POJ1251 Jungle Roads(Kruscal)

http://poj.org/problem?id=1251

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define maxn 102
using namespace std;
struct node
{
    int u;
    int v;
    int w;
} edge[1000];
int pre[10000];
int n,m;
int j;
bool cmp(const node&a,const node&b )
{
    return a.w<b.w;
}
int find(int x)
{
    return x==pre[x]?x:pre[x]=find(pre[x]);
}
void unions(int x,int y)
{
    int fx=find(x);
    int fy=find(y);
    if(fx!=fy)
    {
        pre[fx]=fy;
    }
}
void createGraph()
{
    for(int i=1; i<=n+10; i++)pre[i]=i;
    j=0;
    for(int i=1; i<=n-1; i++)
    {
        char str;
        cin>>str;
        int m;
        cin>>m;
        for(int i=1; i<=m; i++)
        {
            ++j;
            char s;
            cin>>s;
            int num;
            cin>>num;
            edge[j].u=str-'A'+1;
            edge[j].v=s-'A'+1;
            edge[j].w=num;
        }
    }
}
int kruscal()
{
    int ans=0;
    sort(edge+1,edge+j+1,cmp);
    int cnt=0;
    for(int i=1; i<=j; i++)
    {
        if(find(edge[i].u)!=find(edge[i].v))
        {
            cnt++;
            unions(edge[i].u,edge[i].v);
            ans+=edge[i].w;
        }
    }
    return ans;
}
int main()
{
    while(cin>>n&&n)
    {
        createGraph();
        cout<<kruscal()<<endl;
    }
}