作者:知足幸福_21942 | 来源:互联网 | 2023-05-17 12:36
#include
#include
#include
using namespace std;
int par[1020];
int ran[1020];
struct edge{
int u,v,dis;
}e[1020];
bool cmp(edge a,edge b)
{
return a.disint find(int x)
{
int r = x;
while(par[r]!=r)
{
r = par[r];
}
int i = x,j;
while(par[i]!=r)
{
j = par[i];
par[i] = r;
i = j;
}
return r;
}
void merge(int x,int y)
{
x = find(x);
y = find(y);
if(ran[x]else
{
par[y] = x;
if(ran[x]==ran[y])
ran[x]++;
}
}
int main()
{
int n;
while(scanf("%d",&n),n)
{
int m;
cin>>m;
for(int i = 1;i<=n;i++)
{
par[i] = i;
ran[i] = 0;
}
for(int i = 0;icin>>e[i].u>>e[i].v>>e[i].dis;
}
sort(e,e+m,cmp);
int sum = 0;
for(int i = 0;iif(find(e[i].u)!=find(e[i].v))
{
sum+=e[i].dis;
merge(e[i].u,e[i].v);
}
}
cout<return 0;
}