\HeaderA{floyd.warshall.all.pairs.sp}{compute shortest paths for all pairs of nodes}{floyd.warshall.all.pairs.sp}
\keyword{models}{floyd.warshall.all.pairs.sp}
\begin{Description}\relax
compute shortest paths for all pairs of nodes
\end{Description}
\begin{Usage}
\begin{verbatim}
floyd.warshall.all.pairs.sp(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] graph object with edge weights given
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
Compute shortest paths between every pair of vertices for a dense graph.  

The result is given as a distance matrix.

For a sparse matrix, use \code{johnson.all.pairs.sp} instead.

See documentation on these algorithms in Boost Graph Library for more details.
\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
Li Long <li.long@isb-sib.ch>
\end{Author}
\begin{References}\relax
Boost Graph Library by Siek et al.
\end{References}
\begin{SeeAlso}\relax
\code{\LinkA{johnson.all.pairs.sp}{johnson.all.pairs.sp}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/conn.gxl", package="RBGL"), open="r"))
floyd.warshall.all.pairs.sp(coex)
\end{ExampleCode}
\end{Examples}

