#include <lemon/prim.h>
GR | Graph type. | |
LM | Type of cost map. |
Public Types | |
typedef GR | UGraph |
The graph type the algorithm runs on. | |
typedef LM | CostMap |
The type of the map that stores the edge costs. | |
typedef UGraph::template NodeMap< int > | HeapCrossRef |
The cross reference type used by heap. | |
typedef BinHeap< typename UGraph::Node, typename LM::Value, HeapCrossRef, std::less< Value > > | Heap |
The heap type used by Prim algorithm. | |
typedef UGraph::template NodeMap< typename GR::UEdge > | PredMap |
The type of the map that stores the last edges of the minimum spanning tree. | |
typedef NullMap< typename UGraph::UEdge, bool > | TreeMap |
typedef NullMap< typename UGraph::Node, bool > | ProcessedMap |
The type of the map that stores whether a nodes is processed. | |
Static Public Member Functions | |
static HeapCrossRef * | createHeapCrossRef (const GR &_graph) |
Instantiates a HeapCrossRef. | |
static PredMap * | createPredMap (const GR &_graph) |
Instantiates a PredMap. | |
static TreeMap * | createTreeMap (const GR &) |
Instantiates a TreeMap. | |
static ProcessedMap * | createProcessedMap (const GR &_graph) |
Instantiates a ProcessedMap. |
|
The type of the map that stores the edge costs. It must meet the ReadMap concept. |
|
The cross reference type used by heap. Usually it is |
|
The heap type used by Prim algorithm.
|
|
The type of the map that stores the last edges of the minimum spanning tree. It must meet the WriteMap concept. |
|
The type of the map that stores whether an edge is in the spanning tree or not. By default it is a NullMap. |
|
The type of the map that stores whether a nodes is processed. It must meet the WriteMap concept. By default it is a NodeMap<bool>. |
|
This function instantiates a HeapCrossRef.
|
|
This function instantiates a PredMap.
|
|
This function instantiates a TreeMap. The first parameter is the graph, to which we would like to define the TreeMap |
|
This function instantiates a ProcessedMap.
|