采用Kruskal算法求最小生成树主要数据结构

edgeset GE 存放图中的所有边

int n,int e 存放图中的顶点数与边数

edgeset C 存放生成树中的边

vexlist gv 　　图中结点的顶点值

adjmatrix s 用来处理图中结点的查找与合并

int m1,m2 一条边上两顶点所属集合的序号

int k 最小生成树中的边数

int　　d //图中待扫描边元素的下标-For the Minimum Spanning Tree by Kruskal main data structures edgeset GE　store all edges in the figure int n, int e　store graph vertices and edges edgeset C　storage spanning tree edges in the vexlist gv　graph node vertex values ​ ​ adjmatrix s　used to process graph node to find and merge int m1, m2　an edge belongs to the set number two vertices int k　minimum spanning tree edges int d // figure to be Scan edge element subscr ipt