#include <lemon/kruskal.h>
A typical usage:
std::vector<Graph::Edge> v; kruskal(g, input, makeKruskalSequenceOutput(back_inserter(v)));
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().