Iteration k=1
| d[i,j] | 1 | 2 | 3 | 4 | 5 |
| 1 | - | 3.0 | 7.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 0] | Next [Iter 2] | Final Results |
|
Iteration k=1
|
||||||||||||||||||||||||||||||||||||
| Iteration 1. Using k=1 as a potential intermediate node, update the matrix using d(i,j) = min[ d(i,j), (d(i,k) + d(k,j)) ]. Here, cells (3,2) and (4,2) are each now connected using node 1 as an intermediate node. Note that elements in the kth row and column are not updated. | |||||||||||||||||||||||||||||||||||||