compute shortest path distance matrix for all pairs of nodes
compute shortest path distance matrix for all pairs of nodes
johnson.all.pairs.sp(g)
g |
graph object for which edgeMatrix and edgeWeights are defined |
Uses BGL algorithm.
matrix of shortest path lengths, read from row node to col node
Vince Carey <stvjc@channing.harvard.edu>
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
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
con <- file(system.file("dot/joh.gxl", package="RBGL"), open="r")
z <- fromGXL(con)
close(con)
johnson.all.pairs.sp(z)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.