赤裸裸的最小生成树问题。。。
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=400;
int i,n;
int e_u[maxn],e_v[maxn],w[maxn],p[30],rank[maxn];
int cmp(const int &i,const int & j)// 按权值大小给边排序
{
return w[i]<w[j];
}
int find (int x)
{
return p[x]==x?x:p[x]=find(p[x]);
}
int Kruskal (int len)
{
int ans=0;
for (i=1 ; i<=n ; i++) p[i]=i;
for (i=1 ; i<len ; i++) rank[i]=i;
sort(rank+1,rank+len,cmp);
for (i=1 ; i<len ; i++)
{
int e=rank[i];
int x=find(e_u[e]);
int y=find (e_v[e]);
//printf("u=%d,v=%d,i=%d\n",e_u[e],e_v[e],e);
if(x!=y) {ans+=w[e];p[x]=y;/*printf("w%d=%d\n",e,w[e]);*/}
}
return ans;
}
int main ()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int test ;
scanf("%d",&test);
while (test--)
{
scanf("%d",&n);
i=1;
while (scanf("%d%d%d",&e_u[i],&e_v[i],&w[i])&&(e_u[i]||e_v[i]||w[i]))
i++;
int ans=Kruskal(i);
printf("%d\n",ans);
}
return 0;
}