kruskal.h File Reference


Detailed Description

Kruskal's algorithm to compute a minimum cost spanning tree.

#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.


Generated on Tue May 5 07:41:37 2009 for LEMON by  doxygen 1.5.6