My Project
|
Default traits class of BellmanFord class.
GR | The type of the digraph. |
LEN | The type of the length map. |
#include <lemon/bellman_ford.h>
Public Types | |
typedef GR | Digraph |
The type of the digraph the algorithm runs on. | |
typedef LEN | LengthMap |
The type of the map that stores the arc lengths. | |
typedef LEN::Value | Value |
The type of the arc lengths. | |
typedef BellmanFordDefaultOperationTraits< Value > | OperationTraits |
Operation traits for Bellman-Ford algorithm. | |
typedef GR::template NodeMap< typename GR::Arc > | PredMap |
The type of the map that stores the last arcs of the shortest paths. | |
typedef GR::template NodeMap< typename LEN::Value > | DistMap |
The type of the map that stores the distances of the nodes. | |
Static Public Member Functions | |
static PredMap * | createPredMap (const GR &g) |
Instantiates a PredMap . | |
static DistMap * | createDistMap (const GR &g) |
Instantiates a DistMap . | |
typedef LEN LengthMap |
The type of the map that stores the arc lengths. It must conform to the ReadMap concept.
typedef BellmanFordDefaultOperationTraits<Value> OperationTraits |
It defines the used operations and the infinity value for the given Value
type.
typedef GR::template NodeMap<typename GR::Arc> PredMap |
The type of the map that stores the last arcs of the shortest paths. It must conform to the WriteMap concept.
typedef GR::template NodeMap<typename LEN::Value> DistMap |
The type of the map that stores the distances of the nodes. It must conform to the WriteMap concept.
|
inlinestatic |