最小生成树

#include<stdio.h>
#include<algorithm>
using namespace std;
#define N 101
int tree[N];//tree[i]表示结点i的双亲结点
int findroot(int x){//寻找根结点
if(-1==tree[x]){return x;}//-1表示根结点
else {
/*int tmp=findroot(tree[x]);
tree[x]=tmp;
return tmp;*/
return findroot(tree[x]);
}
}


struct edge{
int a,b;
int cost;
bool operator <(const edge &A)const{
return cost<A.cost;
}
}edge[6000];


int main(){
int n;
while(scanf("%d",&n)!=EOF&&n!=0){
for(int i=1;i<=n*(n-1)/2;i++){
scanf("%d%d%d",&edge[i].a,&edge[i].b,&edge[i].cost);
}
sort(edge+1,edge+1+n*(n-1)/2);//权值递增排序
for(int i=1;i<=n;i++){
tree[i]=-1;
}
int ans=0;
for(int i=1;i<=n*(n-1)/2;i++){
int a=findroot(edge[i].a);
int b=findroot(edge[i].b);
if(a!=b){//非同一集合则合并
tree[a]=b;
ans+=edge[i].cost;
}
}
printf("%d",ans);
}
return 0;
}