#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=2000;
struct node
{
int x,y,value;
int flag;
}edge[maxn];
int fa[maxn];
int find(int x)
{
return x==fa[x]?x:find(fa[x]);
}
bool cmp(node a,node b)
{
return a.value<b.value;
}
int main()
{
int m,n,i,j;
while(cin>>m)
{
if(m==0)
break;
cin>>n;
for(i=0;i<n;i++)
{
fa[i]=i;
edge[i].flag=0;
}
for(i=0;i<n;i++)
cin>>edge[i].x>>edge[i].y>>edge[i].value;
sort(edge,edge+n,cmp);
//int ans=0;
for(i=0;i<n;i++)
{
int x1=find(edge[i].x);
int x2=find(edge[i].y);
if(x1!=x2)
{
fa[x1]=x2;
edge[i].flag=1;
// ans+=edge[i].value;
}
}
int ans=0;
for(i=0;i<n;i++)
if(edge[i].flag==1)
ans+=edge[i].value;
cout<<ans<<endl;
}
return 0;
}
E - Networking
最新推荐文章于 2020-11-16 11:19:03 发布