Karger.H File Reference

Karger's randomized min-cut algorithm. More...

#include <cmath>
#include <limits>
#include <vector>
#include <htlist.H>
#include <tpl_sgraph.H>
#include <generate_graph.H>
#include <tpl_graph_utils.H>
#include <ah-errors.H>

Include dependency graph for Karger.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Aleph::Karger_Min_Cut< GT, SA >
	Karger's randomized minimum cut algorithm. More...
class	Aleph::Karger_Min_Cut< GT, SA >::ArcIndex
	Arc index with O(1) operations and deterministic ordering. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Detailed Description

Karger's randomized min-cut algorithm.

Implements Karger's contraction algorithm for finding minimum cuts in graphs. Uses random edge contractions to approximate the minimum cut with high probability.

Author

Leandro Rabindranath León

Definition in file Karger.H.