kruskal.h File Reference


Detailed Description

Kruskal's algorithm to compute a minimum cost tree.

Todo:
The file still needs some clean-up.

#include <algorithm>
#include <vector>
#include <lemon/unionfind.h>
#include <lemon/bits/utility.h>
#include <lemon/bits/traits.h>

Namespaces

namespace  lemon

Classes

class  NonConstMapWr
 Helper class for calling kruskal with "constant" output map. More...
class  KruskalMapInput
 Kruskal's input source. More...
class  KruskalSequenceOutput
 A writable bool-map that makes a sequence of "true" keys. More...

Functions

template<class GR, class IN, class OUT>
IN::value_type::second_type kruskal (GR const &g, IN const &in, OUT &out)
 Kruskal's algorithm to find a minimum cost tree of a graph.
template<class GR, class Map>
KruskalMapInput< GR, Map > makeKruskalMapInput (const GR &g, const Map &m)
 Creates a KruskalMapInput object for kruskal().


Generated on Tue Oct 31 09:49:37 2006 for LEMON by  doxygen 1.5.1