| Function floyd_warshall Finds shortest paths between all pairs of vertices in a graph. floyd_warshall(g, weight, distance, predecessor) Parameters
g | In-parameter:A graph. Types: Graph
weight | In-parameter:A weight map. Remarks: A property map with edge weights. Edge weights may be negative.
distance | Out-parameter:A matrix with distances. Types: Matrix Remarks: Entry (i,j) in this matrix indicates the distance from vertex i to vertex j.
predecessor | 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 Floyd-Warshall Algorithm See Also all_pairs_shortest_path SeqAn - Sequence Analysis Library - www.seqan.de