#include <lemon/dijkstra.h>
Inherited by DijkstraWizardBase.
Inheritance diagram for DijkstraWizardDefaultTraits:
GR | Graph type. | |
LM | Type of length map. |
Public Types | |
typedef GR | Graph |
The graph type the algorithm runs on. | |
typedef LM | LengthMap |
The type of the map that stores the edge lengths. | |
typedef BinHeap< typename Graph::Node, typename LM::Value, typename GR::template NodeMap< int >, std::less< Value > > | Heap |
The heap type used by Dijkstra algorithm. | |
typedef NullMap< typename GR::Node, typename GR::Edge > | PredMap |
The type of the map that stores the last edges of the shortest paths. | |
typedef NullMap< typename Graph::Node, bool > | ProcessedMap |
The type of the map that stores whether a nodes is processed. | |
typedef NullMap< typename Graph::Node, typename LM::Value > | DistMap |
The type of the map that stores the dists of the nodes. | |
Static Public Member Functions | |
static PredMap * | createPredMap (const GR &g) |
Instantiates a PredMap. | |
static ProcessedMap * | createProcessedMap (const GR &g) |
Instantiates a ProcessedMap. | |
static DistMap * | createDistMap (const GR &g) |
Instantiates a DistMap. |
|
The type of the map that stores the edge lengths. It must meet the ReadMap concept. |
|
The heap type used by Dijkstra algorithm.
|
|
The type of the map that stores the last edges of the shortest paths. It must meet the WriteMap concept. |
|
The type of the map that stores whether a nodes is processed. It must meet the WriteMap concept. By default it is a NullMap.
|
|
The type of the map that stores the dists of the nodes. It must meet the WriteMap concept. |
|
This function instantiates a PredMap.
|
|
This function instantiates a ProcessedMap.
|
|
This function instantiates a DistMap.
|