#include <lemon/fredman_tarjan.h>
GR | Graph type. | |
CM | Type of cost map. |
Public Types | |
typedef GR | UGraph |
The graph type the algorithm runs on. | |
typedef CM | CostMap |
The type of the map that stores the edge costs. | |
typedef UGraph::template UEdgeMap< bool > | TreeMap |
Static Public Member Functions | |
static TreeMap * | createTreeMap (const GR &_graph) |
Instantiates a TreeMap. |
typedef CM 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. It must meet the ReadWriteMap concept. By default it is a BoolEdgeMap.
static TreeMap* createTreeMap | ( | const GR & | _graph | ) | [inline, static] |