Kruskal算法代码演示

算法#Kruskala3-c4,15,7,28,9,25,5,32,12,16,20,30#构建图circle-cbindal,a2,a3#按边权排序circle-circle[ordera3Jrow.namescircle-ccount-0#存储满足条件的边tree-matrix,nrow=6,ncol=3#复制一个可修改的图circle2-circlefor iin1:12{#找至条边，终止循环ifcount==6{break}ll6a-circle2[i,]#成环跳出ifa[l]==a

[2]{next}count-count+ltree[count,]-circle[i,]thisl-a[l]this2-a

[2]for jin i:12{p-circle[j,]ifp[l]==this2{circle2[j,l]-thisl}ifp

[2]==this2{circle2[j,2]-thisl}weight-sumas.numerictree[,3]weighttree_lrL6rL5r4Lr3Lr2L1rLr9g61tI1dfg2,,1,,1,,71,5M4,1,[”3JT。