说明：  用贪心算法求最小生成树的问题是可以由这个程序来实现的。它求出在一棵树中哪些边组成的通路具有最小的权值。
(with greedy algorithm for the minimum spanning tree problem can be resolved by this procedure to achieve it. It obtained in a tree in which the edge of the pathway with minimum weight.)