最小生成树，Agri_Net问题解决，有详细的代码解释帮助理解-Minimum spanning tree, Agri_Net problem solving, detailed code explained to help understand

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.