Finds shortest paths between all pairs of vertices in a graph.
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.
Remarks: Entry (i,j) in this matrix indicates the distance from vertex i to vertex j.
Out-parameter:A matrix with predecessors.
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.
The graph must be free of negative-weight cycles.
SeqAn - Sequence Analysis Library - www.seqan.de