Talk:Floyd–Warshall algorithm

Change pseudocode to Wikicode?

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

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]
}

I will change this soon if nobody protests