Talk:Floyd–Warshall algorithm

This is an old revision of this page, as edited by Ropez (talk | contribs) at 22:49, 10 May 2005 (Change pseudocode to Wikicode?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Change pseudocode to Wikicode?

The pseudocode in this article is very hard to understand. I suggest changing it to something like this:

Template:Wikicode

 function fw(int[0..n,0..n] graph) {
     var int[0..n,0..n] dist := graph
     for k from 0 to n
         for i from 0 to n
             for j from 0 to n
                 if dist[i,j] > dist[i,k] + dist[k,j]
                     dist[i,j] = dist[i,k] + dist[k,j]
     return dist
 }

I will change this soon if nobody protests