#include<iostream>#include<algorithm>#include<string.h>usingnamespacestd;
#define M 10005 struct node { //定义边的结构体,包含边的起始城市,结束城市,路的距离int start;
int end;
int dis;
}edge[10005];
int disjoint[M];
int find(int x)
{
int temp=x;
while(disjoint[temp]!= temp) //一直找到根节点
temp =disjoint[temp];
return temp;
}
int merge(int a, int b)
{
int fa, fb;
fa = find(a);
fb = find(b);
if (fa != fb)
{
disjoint[fa] = fb; return1;
}
elsereturn0;
}
bool cmp(node n,node m) //间接排序
{
return n.dis < m.dis;
}
int main()
{
int n,i,j;
while (scanf("%d",&n)&&n)
{
int count = n*(n - 1) / 2;
for (i = 1; i <= count; i++)
disjoint[i] = i; //初始化并查集for (i = 1; i <= count; i++)
scanf("%d%d%d", &edge[i].start, &edge[i].end, &edge[i].dis);
sort(edge+1, edge + count+1, cmp); //将边长按从小到大排序int sum = 0,num=0;
for (j = 1; j <=count&&num<n; j++)
{
if (merge(edge[j].start,edge[j].end))
{
sum += edge[j].dis;
num++;
}
}
cout << sum << endl;
}
}
HDOJ1233\#include#include#includeusing namespace std;#define M 10005 struct node { //定义边的结构体,包含边的起始城市,结束城市,路的距离 int start; int end; int dis;}edge[10005];int disjoint[M];