johnson.all.pairs.sp

compute shortest path distance matrix for all pairs of nodes

compute shortest path distance matrix for all pairs of nodes

Keywords
models
Usage
johnson.all.pairs.sp(g)
Arguments
g
graph object for which edgeMatrix and edgeWeights are defined
Details

Uses BGL algorithm.

Value

matrix of shortest path lengths, read from row node to col node

References

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

See Also

bellman.ford.sp, dag.sp, dijkstra.sp, sp.between

Aliases
  • johnson.all.pairs.sp
Examples
con <- file(system.file("dot/joh.gxl", package="RBGL"), open="r")
z <- fromGXL(con)
close(con)

johnson.all.pairs.sp(z)
Documentation reproduced from package RBGL, version 1.48.1, License: Artistic-2.0

Community examples

Looks like there are no examples yet.