|
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 Graph::template NodeMap<
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 Graph::template NodeMap<
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.
|