Iteration k=5
| d[i,j] | 1 | 2 | 3 | 4 | 5 |
| 1 | - | 3.0 | 6.0 | 9.0 | 12.0 |
| 2 | 10.0 | - | 3.0 | 6.0 | 9.0 |
| 3 | 7.0 | 10.0 | - | 3.0 | 7.0 |
| 4 | 4.0 | 7.0 | 2.0 | - | 4.0 |
| 5 | 15.0 | 18.0 | 8.0 | 11.0 | - |
| Floyd's Algorithm | Base Network | Prior [Iter 4] | Final Results |
|
Iteration k=5
|
||||||||||||||||||||||||||||||||||||
| Iteration 5. Using k=5 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, no cells can be improved using node 5 as an intermediate node. Since there are only 5 nodes in the network, Floyd's Algorithm is completed and all paths become permanently labeled. | |||||||||||||||||||||||||||||||||||||