The algorithm solves the shortest path problem for each pair of node when the edges can have negative length but the graph should not contain cycles with negative sum of length. If we can assume that all edge is non-negative in the graph then the dijkstra algorithm should be used from each node rather and if the graph is sparse and there are negative circles then the johnson algorithm.
The complexity of this algorithm is O(n^3 + e).
|
Public Types |
typedef _Traits::Graph | Graph |
| The type of the underlying graph.
|
typedef _Traits::LengthMap::Value | Value |
| The type of the length of the edges.
|
typedef _Traits::LengthMap | LengthMap |
| The type of the map that stores the edge lengths.
|
typedef _Traits::PredMap | PredMap |
| The type of the map that stores the last edges of the shortest paths. The type of the PredMap is a matrix map for Edges.
|
typedef _Traits::DistMap | DistMap |
| The type of the map that stores the dists of the nodes. The type of the DistMap is a matrix map for Values.
|
typedef _Traits::OperationTraits | OperationTraits |
| The operation traits.
|
Public Member Functions |
| FloydWarshall (const Graph &_graph, const LengthMap &_length) |
| Constructor.
|
| ~FloydWarshall () |
| Destructor.
|
FloydWarshall & | lengthMap (const LengthMap &m) |
| Sets the length map.
|
FloydWarshall & | predMap (PredMap &m) |
| Sets the map storing the predecessor edges.
|
FloydWarshall & | distMap (DistMap &m) |
| Sets the map storing the distances calculated by the algorithm.
|
|
The simplest way to execute the algorithm is to use one of the member functions called run (...).
If you need more control on the execution, Finally start() will perform the actual path computation.
|
void | init () |
| Initializes the internal data structures.
|
void | start () |
| Executes the algorithm.
|
bool | checkedStart () |
| Executes the algorithm and checks the negative cycles.
|
void | run () |
| Runs FloydWarshall algorithm.
|
|
The result of the FloydWarshall algorithm can be obtained using these functions.
Before the use of these functions, either run() or start() must be called.
|
template<typename Path> |
bool | getPath (Path &p, Node source, Node target) |
| Copies the shortest path to t into p .
|
Value | dist (Node source, Node target) const |
| The distance between two nodes.
|
Edge | predEdge (Node root, Node node) const |
| Returns the 'previous edge' of the shortest path tree.
|
Node | predNode (Node root, Node node) const |
| Returns the 'previous node' of the shortest path tree.
|
const DistMap & | distMap () const |
| Returns a reference to the matrix node map of distances.
|
const PredMap & | predMap () const |
| Returns a reference to the shortest path tree map.
|
bool | connected (Node source, Node target) |
| Checks if a node is reachable from the root.
|
Classes |
struct | DefDistMap |
| Named parameter for setting DistMap type More...
|
struct | DefOperationTraits |
| Named parameter for setting OperationTraits type More...
|
struct | DefPredMap |
| Named parameter for setting PredMap type Named parameter for setting PredMap type More...
|
class | UninitializedParameter |
| Exception for uninitialized parameters. More...
|