|
Public Types |
typedef GR | Graph |
| The graph type the algorithm runs on.
|
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 indicates which nodes are processed.
|
typedef Graph::template NodeMap<
bool > | ReachedMap |
| The type of the map that indicates which nodes are reached.
|
typedef Graph::template NodeMap<
int > | 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 ReachedMap * | createReachedMap (const GR &G) |
| Instantiates a ReachedMap.
|
static DistMap * | createDistMap (const GR &G) |
| Instantiates a DistMap.
|