Minimal Spanning Tree algorithm

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.

1	2	3	4	5	6	7	8	9
inf	inf	inf	inf	inf	inf	inf	inf	inf
17	4	3	inf	inf	inf	inf	inf	inf
2	4	3	1	inf	inf	inf	5	inf
2	4	3	1	5	inf	inf	5	inf
2	4	3	1	4	inf	4	5	11
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8

1	2	3	4	5	6	7	8	9
inf	inf	inf	inf	inf	inf	inf	inf	inf
17	4	3	inf	inf	inf	inf	inf	inf
2	4	3	1	inf	inf	inf	5	inf
2	4	3	1	5	inf	inf	5	inf
2	4	3	1	4	inf	4	5	11
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8

1	2	3	4	5	6	7	8	9
inf	inf	inf	inf	inf	inf	inf	inf	inf
17	4	3	inf	inf	inf	inf	inf	inf
2	4	3	1	inf	inf	inf	5	inf
2	4	3	1	5	inf	inf	5	inf
2	4	3	1	4	inf	4	5	11
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8

1	2	3	4	5	6	7	8	9
inf	inf	inf	inf	inf	inf	inf	inf	inf
17	4	3	inf	inf	inf	inf	inf	inf
2	4	3	1	inf	inf	inf	5	inf
2	4	3	1	5	inf	inf	5	inf
2	4	3	1	4	inf	4	5	11
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8
2	4	3	1	4	inf	4	3	8