|
Iteration 3. Using k=3 as a potential intermediate node, update
the matrix using d(i,j) = min[ d(i,j), (d(i,k) + d(k,j)) ].
Here, cells (1,4), (2,1), (2,4), (5,1), (5,2), and (5,4) are connected using
node 3 as an intermediate node. Note that cell (5,2) combines cell (5,3),
representing a link (5,3), with cell (3,2), representing a path (3-1-2)
created in Iteration 1. Similarly, cell (1,4) combines cell (1,3), a path
found in Iteration 2, with cell (3,4), a link.
Note that elements in the kth row and column are not updated.
|
