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>

Namespaces

namespace  lemon
namespace  lemon::_kruskal_bits

Classes

struct  KruskalDefaultTraits
 Default traits class of Kruskal class. More...
class  Kruskal
 Kruskal's algorithm to find a minimum cost tree of a graph. More...
struct  Kruskal::DefSortCompare
 Named parameter for setting the comparator object of the standard sort More...
struct  Kruskal::DefRadixSort
 Named parameter for setting the sort function to radix sort More...
struct  Kruskal::DefTreeMap
 Named parameter for setting TreeMap More...

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.


Generated on Sat Apr 19 14:16:54 2008 for LEMON by  doxygen 1.5.5