POJ1251（基础的最小代价生成树问题）

运用Kruskal算法+并查集，算是复习了一下并查集和求最小代价生成树的知识。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int n,sum,num,bin[80];
bool visit[30];

struct node      //所有的村庄从1开始标号
{
    int x;
    int y;
    int w;
}edge[80];

int cmp(const void *a,const void *b)
{
    node *p=(node *)a,*q=(node *)b;
    return p->w-q->w;
}

int find(int x)
{
    int r;
    r=x;
    while(r!=bin[r])
    r=bin[r];
    return r;
}

void Kruskal()
{
    int i,j,u,v,temp1,temp2;
    int a,b;
    for(i=0;i<num;i++)
    {
        u=edge[i].x;
        v=edge[i].y;
        if(!visit[u] && !visit[v])
        {
            a=find(u);
            b=find(v);
            bin[a]=b;
            sum+=edge[i].w;
            visit[u]=true;
            visit[v]=true;
        }
        else if(!visit[u] && visit[v])
        {
            a=find(u);
            b=find(v);
            bin[a]=b;
            sum+=edge[i].w;
            visit[u]=true;
            visit[v]=true;
        }
        else if(visit[u] && !visit[v])
        {
            a=find(u);
            b=find(v);
            bin[b]=a;
            sum+=edge[i].w;
            visit[u]=true;
            visit[v]=true;
        }
        else
        {
            a=find(u);
            b=find(v);
            if(a==b)        //避免形成回路
            continue;
            else
            bin[a]=bin[b];
            sum+=edge[i].w;
        }
    }
}

int main()
{
    int i,j,k,weight,temp;
    char ch;
    while(scanf("%d",&n) && n!=0)
    {
        num=0;
        for(i=1;i<=n;i++)
        bin[i]=i;
        for(i=0;i<n-1;i++)
        {
            scanf(" %c",&ch);
            temp=ch-'A'+1;
            scanf(" %d",&k);
            for(j=0;j<k;j++)
            {
                edge[num].x=temp;
                scanf(" %c",&ch);
                edge[num].y=ch-'A'+1;
                scanf(" %d",&weight);
                edge[num++].w=weight;
            }
        }
        qsort(edge,num,sizeof(edge[0]),cmp);
        memset(visit,0,sizeof(visit));
        sum=0;
        Kruskal();
        printf("%d\n",sum);
    }
    return 0;
}