摘要
通过给网络G的每一个顶点赋予一个所在连通分支编号的方法 ,来判定每条边的加入是否构成圈 ,讨论了Kruskal算法中判定圈的新途径 。
This paper give a method of judging whether addition of edge make up cycles by giving every vertex a connected component No. of network-G,give a new realization of Kruskal algorithm.
关键词
圈
网络
最小生成树
树图
邻接矩阵
KRUSKAL算法
cycle
network
minimum cost spanning tree
connected component
tree graph
adjacent matrix
