floyd.warshall.all.pairs.sp: compute shortest paths for all pairs of nodes
Description
compute shortest paths for all pairs of nodes
Usage
floyd.warshall.all.pairs.sp(g)
Arguments
g
graph object with edge weights given
Value
A matrix of shortest path lengths between all pairs of nodes in the graph.
Details
Compute shortest paths between every pair of vertices for a dense graph.
It works on both undirected and directed graph.
The result is given as a distance matrix. The matrix is symmetric for an
undirected graph, and asymmetric (very likely) for a directed graph.
For a sparse graph, the johnson.all.pairs.sp functions
should be used instead.
See documentation on these algorithms in Boost Graph Library for more details.
The Boost Graph Library: User Guide and Reference Manual;
by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine;
(Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp.
ISBN 0-201-72914-8