Content deleted Content added
No edit summary |
|||
Line 25:
:Late protest :). The article uses vertices from a set from 1 to n. The above pseudocode/wikicode uses a set from 0 to n. This is confusing. Besides, it is not clear which values the adjacency matrix is supposed to have at [i,j] when there is no edge between two vertices i and j (and how about the value at [i,i]... infinity?). Any idea? Thanks, --[[User:Abdull|Abdull]] 10:41, 9 March 2006 (UTC)
::The whole ideea of roy-floyd algorithm is that the whole dist[i,j] matrix contains only infinity at first, then the graph is copyed upon it, changing for known vertices the distance. So there should be a change at the initialization part--[[User:Tudalex|Tudalex]] 17:51, 23 March 2007 (UTC)
== Predecessor matrix? ==
| |||