_Graph | Graph type. | |
_LegthMap | Type of length map. |
#include <lemon/floyd_warshall.h>
Public Types | |
typedef _Graph | Graph |
The graph type the algorithm runs on. | |
typedef _LengthMap | LengthMap |
The type of the map that stores the edge lengths. | |
typedef FloydWarshallDefaultOperationTraits < Value > | OperationTraits |
Operation traits for floyd-warshall algorithm. | |
typedef DynamicMatrixMap < Graph, typename Graph::Node, typename Graph::Edge > | PredMap |
The type of the matrix map that stores the last edges of the shortest paths. | |
typedef DynamicMatrixMap < Graph, typename Graph::Node, Value > | DistMap |
The type of the map that stores the dists of the nodes. | |
Static Public Member Functions | |
static PredMap * | createPredMap (const _Graph &graph) |
Instantiates a PredMap. | |
static DistMap * | createDistMap (const _Graph &graph) |
Instantiates a DistMap. |
typedef _LengthMap LengthMap |
The type of the map that stores the edge lengths. It must meet the ReadMap concept.
typedef FloydWarshallDefaultOperationTraits<Value> OperationTraits |
It defines the infinity type on the given Value type and the used operation.
typedef DynamicMatrixMap<Graph, typename Graph::Node, typename Graph::Edge> PredMap |
The type of the map that stores the last edges of the shortest paths. It must be a matrix map with Graph::Edge
value type.
typedef DynamicMatrixMap<Graph, typename Graph::Node, Value> DistMap |
The type of the map that stores the dists of the nodes. It must meet the WriteMatrixMap concept.
static PredMap* createPredMap | ( | const _Graph & | graph | ) | [inline, static] |
static DistMap* createDistMap | ( | const _Graph & | graph | ) | [inline, static] |