KruskalSequenceOutput Class Template Reference
#include <lemon/kruskal.h>
List of all members.
Detailed Description
template<class Iterator>
class lemon::KruskalSequenceOutput< Iterator >
A writable bool-map that creates a sequence out of keys that receives the value "true".
- See also:
- makeKruskalSequenceOutput()
Very often, when looking for a min cost spanning tree, we want as output a container containing the edges of the found tree. For this purpose exist this class that wraps around an STL iterator with a writable bool map interface. When a key gets value "true" this key is added to sequence pointed by the iterator.
A typical usage:
For the most common case, when the input is given by a simple edge map and the output is a sequence of the tree edges, a special wrapper function exists: kruskalEdgeMap_IteratorOut().
- Warning:
- Not a regular property map, as it doesn't know its Key
The documentation for this class was generated from the following file:
Generated on Sat Aug 27 14:15:38 2005 for LEMON by
1.4.4