Explanation of minimal spanning tree
The table below shows the order in which nodes are added to the minimal spanning tree rooted at node 0.
In each iteration, a new node is added to the tree, and the distance to that node from all nodes adjacent to it are updated.
Refresh the page to see
another randomly generated unweighted graph.
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|---|
| 0 | inf | inf | inf | inf | inf | inf | inf | inf | inf |
| 0 | inf | inf | 5 | inf | inf | 17 | inf | inf | inf |
| 0 | 19 | inf | 5 | inf | inf | 17 | inf | inf | inf |
| 0 | 9 | 12 | 5 | inf | inf | 17 | inf | 15 | inf |
| 0 | 9 | 8 | 5 | 1 | 5 | 17 | inf | 12 | inf |
| 0 | 9 | 8 | 5 | 1 | 5 | 17 | inf | 12 | 4 |
| 0 | 9 | 8 | 5 | 1 | 5 | 17 | inf | 3 | 4 |
| 0 | 9 | 8 | 5 | 1 | 5 | 17 | inf | 3 | 4 |
| 0 | 9 | 8 | 5 | 1 | 5 | 17 | inf | 3 | 4 |
| 0 | 9 | 8 | 5 | 1 | 5 | 17 | 1 | 3 | 4 |