min_cut_graph.hpp File Reference

#include <vector>
#include <utility>
#include <unordered_map>
#include <map>
#include <unordered_set>

Classes
struct	vg::algorithms::Edge
struct	vg::algorithms::Node
struct	vg::algorithms::Graph

Namespaces
	vg
	vg::algorithms

Functions
pair< vector< unordered_set< size_t > >, size_t >	vg::algorithms::kargers_min_cut (Graph graph, const int seed)
pair< vector< unordered_set< size_t > >, size_t >	vg::algorithms::compute_min_cut (Graph graph, const int seed)
vector< unordered_set< size_t > >	vg::algorithms::min_cut_decomposition (Graph graph, const int seed)

Detailed Description

A randomized, probabilistic algorithm that finds the min cut on an undirected, weighted graph that holds the indices of snarls