_UGraph | Undirected graph type. | |
_CostMap | Type of cost map. |
#include <lemon/kruskal.h>
Public Types | |
typedef _UGraph | UGraph |
The graph type the algorithm runs on. | |
typedef _CostMap | CostMap |
The type of the map that stores the edge costs. | |
typedef _CostMap::Value | Value |
The type of the cost of the edges. | |
typedef _UGraph::template UEdgeMap< bool > | TreeMap |
Static Public Member Functions | |
static TreeMap * | createTreeMap (const _UGraph &graph) |
Instantiates a TreeMap. |
typedef _CostMap CostMap |
The type of the map that stores the edge costs. It must meet the ReadMap concept.
typedef _UGraph::template UEdgeMap<bool> TreeMap |
The type of the map that stores whether an edge is in the spanning tree or not.
static TreeMap* createTreeMap | ( | const _UGraph & | graph | ) | [inline, static] |