kruskal.h File Reference


Detailed Description

Kruskal's algorithm to compute a minimum cost tree.

Definition in file kruskal.h.#include <algorithm>
#include <lemon/unionfind.h>

Include dependency graph for kruskal.h:

Include dependency graph

Go to the source code of this file.

Namespaces

namespace  lemon

Classes

class  NonConstMapWr
 Helper class for calling kruskal with "constant" output map. More...
class  KruskalMapInput
 Kruskal 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().
template<class GR, class IN, class RET> IN::ValueType kruskalEdgeMap (GR const &G, IN const &in, RET &out)
 Wrapper function to kruskal(). Input is from an edge map, output is a plain bool map.
template<class GR, class IN, class RET> IN::ValueType kruskalEdgeMap_IteratorOut (const GR &G, const IN &in, RET out)
 Wrapper function to kruskal(). Input is from an edge map, output is an STL Sequence.


Generated on Thu Sep 30 12:18:35 2004 for LEMON by doxygen 1.3.8