Revision as of 15:32, 28 June 2005 edit Netvor (talk \| contribs) 102 edits Predecessor matrix? ← Previous edit		Revision as of 22:11, 28 June 2005 edit undo Ropez (talk \| contribs) 146 edits →Predecessor matrix? Next edit →
Line 28: pred[i,j] = pred[k,j] I'm not entirely sure if this addition would be appreciated. Being a novice Wikipedian, I decided I won't make the addition but rather post it here. If an experienced Wikipedian thinks it's a good addition, please make it. :I think that's a good idea. IFAIK the "Warshall" part of the algorithm means that it will actually find the paths. If it is used to find just the distances, it should be called just "Floyd's algorithm". I may be wrong. Anyway, I say go ahead and make the changes. --[[User:Ropez\|Ropez]] 28 June 2005 22:11 (UTC)

Talk:Floyd–Warshall algorithm: Difference between revisions