Iteration k=2
| d[i,j] | 1 | 2 | 3 | 4 | 5 |
| 1 | - | 3.0 | 6.0 | ∞ | 12.0 |
| 2 | ∞ | - | 3.0 | ∞ | 9.0 |
| 3 | 7.0 | 10.0 | - | 3.0 | 8.0 |
| 4 | 4.0 | 7.0 | 2.0 | - | 4.0 |
| 5 | ∞ | ∞ | 8.0 | ∞ | - |
| Floyd's Algorithm | Base Network | Prior [Iter 1] | Next [Iter 3] | Final Results |
|
Iteration k=2
|
||||||||||||||||||||||||||||||||||||
| Iteration 2. Using k=2 as a potential intermediate node, update the matrix using d(i,j) = min[ d(i,j), (d(i,k) + d(k,j)) ]. Here, cell (1,3) is improved and (1,5) is connected, both using node 2 as an intermediate node. Note that elements in the kth row and column are not updated. | |||||||||||||||||||||||||||||||||||||