kruskal.h File Reference

---

Detailed Description

Kruskal's algorithm to compute a minimum cost tree. #include <algorithm>
#include <vector>
#include <lemon/unionfind.h>
#include <lemon/graph_utils.h>
#include <lemon/maps.h>
#include <lemon/radix_sort.h>
#include <lemon/bits/utility.h>
#include <lemon/bits/traits.h>

Classes
struct	KruskalDefaultTraits< _UGraph, _CostMap >
	Default traits class of Kruskal class. More...
class	Kruskal< _UGraph, _CostMap, _Traits >
	Kruskal's algorithm to find a minimum cost tree of a graph. More...
struct	DefSortCompare< Comp >
struct	DefRadixSort
	Named parameter for setting the sort function to radix sort More...
struct	DefTreeMap< TM >
Namespaces
namespace	lemon
	The namespace of LEMON.
Functions
template<class Graph , class In , class Out >
Value	kruskal (GR const &g, const In &in, Out &out)
	Kruskal's algorithm to find a minimum cost tree of a graph.