\HeaderA{johnson.all.pairs.sp}{compute shortest path distance matrix for all pairs of nodes}{johnson.all.pairs.sp}
\keyword{models}{johnson.all.pairs.sp}
\begin{Description}\relax
compute shortest path distance matrix for all pairs of nodes
\end{Description}
\begin{Usage}
\begin{verbatim}
johnson.all.pairs.sp(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] graph object for which edgeMatrix and edgeWeights are defined
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
Uses BGL algorithm.
\end{Details}
\begin{Value}
matrix of shortest path lengths, read from row node to col node
\end{Value}
\begin{Note}\relax
\end{Note}
\begin{Author}\relax
Vince Carey <stvjc@channing.harvard.edu>
\end{Author}
\begin{References}\relax
BGL
\end{References}
\begin{SeeAlso}\relax
\code{\LinkA{bellman.ford.sp}{bellman.ford.sp}}, \code{\LinkA{dag.sp}{dag.sp}}, \code{\LinkA{dijkstra.sp}{dijkstra.sp}}, \code{\LinkA{sp.between}{sp.between}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
z <- fromGXL(file(system.file("dot/joh.gxl", package="RBGL"), open="r"))
johnson.all.pairs.sp(z)
\end{ExampleCode}
\end{Examples}

