Data Structure – codewindow.in

for each i from 1 to n:
    for each j from 1 to n:
        if i == j:
            dist[i][j] = 0
        else if there is an edge from i to j:
            dist[i][j] = weight of the edge from i to j
        else:
            dist[i][j] = infinity

for each k from 1 to n:
    for each i from 1 to n:
        for each j from 1 to n:
            dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])