This code consists of the example of Kruskal s algorithm to find the minimum-spanning-tree which connects all the nodes through the edge with the least minimum edge values without creating the cycle.