Definition in file kruskal.h.
#include <algorithm>
#include <lemon/unionfind.h>
Include dependency graph for kruskal.h:
Go to the source code of this file.
Namespaces | |
namespace | lemon |
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::Value | 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 | 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. |