#include <lemon/floyd_warshall.h>
_Graph | Graph type. | |
_LegthMap | Type of length map. |
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. |
|
The type of the map that stores the edge lengths. It must meet the ReadMap concept. |
|
It defines the infinity type on the given Value type and the used operation.
|
|
The type of the map that stores the last edges of the shortest paths. It must be a matrix map with |
|
The type of the map that stores the dists of the nodes. It must meet the WriteMatrixMap concept. |
|
This function instantiates a PredMap.
|
|
This function instantiates a DistMap.
|