Initialization
| d[i,j] | 1 | 2 | 3 | 4 | 5 |
| 1 | - | 3.0 | 7.0 | ∞ | ∞ |
| 2 | ∞ | - | 3.0 | ∞ | 9.0 |
| 3 | 7.0 | ∞ | - | 3.0 | 8.0 |
| 4 | 4.0 | ∞ | 2.0 | - | 4.0 |
| 5 | ∞ | ∞ | 8.0 | ∞ | - |
| Floyd's Algorithm | Base Network: Initialization | Next [Iter 1] | Final Results |
|
Initialization
|
||||||||||||||||||||||||||||||||||||
| Initialization. For a specified network of N nodes, enter all links (i,j) into the corresponding matrix cell. Set all diagonal elements (i,i) to 0 and all other cells to infinity. Find the minimum paths from all nodes to all other nodes. | |||||||||||||||||||||||||||||||||||||