Name
floyd — finds a matrix of shortest paths for given digraph
Synopsis
[U[,P[,M]]]=FLOYD(G)
Description
The lengths of edges are set as UserParam in object edge included in G. If UserParam is empty, length is Inf.
Parameters:
- G
object graph
- U
matrix of shortest paths; if U(i,i)<0 then the digraph contains a cycle of negative length!
- P
matrix of the vertex predecessors in the shortest path
- M
Adjacency Matrix of lengths
Note: All matrices have the size nxn, where n is a number of vertices.
Webmaster - Jan Dvořák (2004 - 2024)