Floyd's Algorithm Base Network Prior [Iter 3] Next [Iter 5] Final Results

Iteration k=4

d[i,j] 1 2 3 4 5
1-3.06.09.012.0
210.0-3.06.09.0
37.010.0-3.07.0
44.07.02.0-4.0
515.018.08.011.0-
Iteration 4. Using k=4 as a potential intermediate node, update the elements of the matrix using d(i,j) = min[ d(i,j), (d(i,k) + d(k,j)) ]. Here, cell (3,5) is updated using node 4 as an intermediate node. Note that elements in the kth row and column are not updated.
Last Updated: 14 February 2006 / mgm