#include <algorithm>
#include <lemon/unionfind.h>
#include <lemon/utility.h>
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'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 | 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(). |