Kruskal s algorithm implementation for generating minimum spanning tree. Random network is generated. Then MST is generated using kruskals and then density gradient applied.

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.