题目来源:poj 1251
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100;
const int maxm = 5010;
int n;
struct edge
{
int u, v;
int w;
edge() {}
edge(int _u, int _v, int _w) : u(_u), v(_v), w(_w) {}
} E[maxm];
bool cmp(edge e1, edge e2)
{
return e1.w < e2.w;
}
//并查集部分
int father[maxn];
int find(int x)
{
if (x == father[x])
{
return x;
}
else
{
int F = find(father[x]);
father[x] = F;
return F;
}
}
//kruskal部分
int kruskal(int n, int m)
{
int ans = 0; //所求边权之和
int num_edge = 0; //当前生成树包含的边的数目
for (int i = 0; i < n; i++) //并查集初始化,顶点编号范围是[0,n-1]
{
father[i] = i;
}
sort(E, E + m, cmp);
for (int i = 0; i < m; i++)
{
int faU = find(E[i].u);
int faV = find(E[i].v);
if (faU != faV)
{
father[faU] = faV; //合并集合,即把测试边加入最小生成树中
num_edge++;
ans += E[i].w;
if (num_edge == n - 1)
{
break;
}
}
}
if (num_edge != n - 1)
{
return -1; //无法连通时返回-1
}
else
{
return ans;
}
}
int main()
{
while (cin >> n && n != 0)
{
int count = 0;
for (int i = 0; i < n - 1; i++)
{
char c;
int num;
cin >> c >> num;
for (int j = 1; j <= num; j++)
{
char c1;
int w;
cin >> c1 >> w;
E[count++] = edge(c - 'A', c1 - 'A', w);
}
}
cout << kruskal(n, count) << endl;
}
return 0;
}