#include <algorithm>
#include <vector>
#include <lemon/unionfind.h>
#include <lemon/maps.h>
#include <lemon/core.h>
#include <lemon/bits/traits.h>
Namespaces | |
namespace | lemon |
namespace | lemon::_kruskal_bits |
Functions | |
template<class Graph, class In, class Out> | |
Value | kruskal (GR const &g, const In &in, Out &out) |
Kruskal algorithm to find a minimum cost spanning tree of a graph. |