Function
floyd_warshall
Finds shortest paths between all pairs of vertices in a graph.
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 _print_all_pairs_shortest_path(g, predecessor, i, j) to print the shortest path from i to j. |
Return Values
void
Remarks
The graph must be free of negative-weight cycles.
Example Programs
See Also
SeqAn - Sequence Analysis Library - www.seqan.de