Collaboration diagram for Minimum Cost Spanning Tree Algorithms:
![]() |
Files | |
file | kruskal.h |
Kruskal's algorithm to compute a minimum cost tree. | |
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 | lemon::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 > | lemon::makeKruskalMapInput (const GR &G, const Map &m) |
Creates a KruskalMapInput object for kruskal(). | |
template<class GR, class IN, class RET> | |
IN::Value | lemon::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::Value | lemon::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. |
|
This function runs Kruskal's algorithm to find a minimum cost tree.
|
|
It makes is easier to use KruskalMapInput by making it unnecessary to explicitly give the type of the parameters. In most cases you possibly want to use the function kruskalEdgeMap() instead.
|
|
Wrapper function to kruskal(). Input is from an edge map, output is a plain bool map.
|
Here is the call graph for this function:
|
Wrapper function to kruskal(). Input is from an edge map, output is an STL Sequence.
|
Here is the call graph for this function: