johnson.all.pairs.sp {RBGL} | R Documentation

## compute shortest path distance matrix for all pairs of nodes

### Description

compute shortest path distance matrix for all pairs of nodes

### 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

### Note

### Author(s)

Vince Carey <stvjc@channing.harvard.edu>

### 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`

### Examples

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

    johnson.all.pairs.sp(z)

[Package RBGL version 1.14.0 Index]