johnson.all.pairs.sp: compute shortest path distance matrix for all pairs of nodes
In RBGL: An interface to the BOOST graph library

Description Usage Arguments Details Value Author(s) References See Also Examples

compute shortest path distance matrix for all pairs of nodes

1	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

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

con <- file(system.file("dot/joh.gxl", package="RBGL"), open="r")
z <- fromGXL(con)
close(con)

johnson.all.pairs.sp(z)

Loading required package: graph
Loading required package: BiocGenerics
Loading required package: parallel

Attaching package: 'BiocGenerics'

The following objects are masked from 'package:parallel':

    clusterApply, clusterApplyLB, clusterCall, clusterEvalQ,
    clusterExport, clusterMap, parApply, parCapply, parLapply,
    parLapplyLB, parRapply, parSapply, parSapplyLB

The following objects are masked from 'package:stats':

    IQR, mad, sd, var, xtabs

The following objects are masked from 'package:base':

    Filter, Find, Map, Position, Reduce, anyDuplicated, append,
    as.data.frame, cbind, colMeans, colSums, colnames, do.call,
    duplicated, eval, evalq, get, grep, grepl, intersect, is.unsorted,
    lapply, lengths, mapply, match, mget, order, paste, pmax, pmax.int,
    pmin, pmin.int, rank, rbind, rowMeans, rowSums, rownames, sapply,
    setdiff, sort, table, tapply, union, unique, unsplit, which,
    which.max, which.min

  a  b  e  c d
a 0  1 -4 -3 2
b 3  0 -1 -4 1
e 8  5  0  1 6
c 7  4  3  0 5
d 2 -1 -2 -5 0