Function
floydWarshallAlgorithm
Finds shortest paths between all pairs of vertices in a graph.
Include Headers
seqan/graph_algorithms.h
Parameters
|  In-parameter:A directed graph. Types:  Directed Graph | |
|  In-parameter:A weight map. Remarks: A property map with edge weights. Edge weights may be negative. | |
|  Out-parameter:A matrix with distances. Types:  Matrix Remarks: Entry (i,j) in this matrix indicates the distance from vertex i to vertex j. | |
|  Out-parameter:A matrix with predecessors. Types:  Matrix Remarks: Entry (i,j) in this matrix indicates the predecessor of j on a shortest path from vertex i to vertex j.
You can use _printAllPairsShortestPath(g, predecessor, i, j) to print the shortest path from i to j. | 
Remarks
 The graph must be free of negative-weight cycles.
Return Values
 void
Example Programs
See Also
SeqAn - Sequence Analysis Library - www.seqan.de