(1)利用普里姆算法求网的最小生成树

(2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过

程中的连通分量。

(3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights