HDU-1233 -还是畅通工程 -最小生成树

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1233



#include<cstdio>
#include<cstring>
#define oo 2000000000
const int MAX=110;
int low[MAX],G[MAX][MAX];
bool visited[MAX];
int min(int a,int b){return a<b?a:b;}
int prim(int n)
{
    int i,j,pos,ans=0;
    pos=1;i=1;
    memset(visited,0,sizeof(visited));
    memset(low,0,sizeof(low));
    int minn=oo;
    visited[1]=1;
    for(i=1;i<=n;++i)
        low[i]=G[pos][i];
    for(int z=1;z<n;++z){
    for(j=1,minn=oo;j<=n;++j)
    {
        if(!visited[j]&&low[j]<minn)
        {
            minn=low[j];pos=j;
        }
    }
    visited[pos]=1;
    ans+=minn;

    for(j=1;j<=n;++j)
    {
        if(!visited[j]&&G[pos][j]<low[j])
            low[j]=G[pos][j];
    }
    }
    return ans;
}
int main()
{
    int v,edge;
    int s,e,w;
    while(scanf("%d",&v),v)
    {
        edge=v*(v-1)/2;
        for(int i=0;i<=MAX;++i)
            for(int j=0;j<=MAX;++j)
            G[i][j]=oo;
        for(int i=0;i<edge;i++)
        {
            scanf("%d %d %d",&s,&e,&w);
            G[s][e]=min(G[s][e],w);
            G[e][s]=min(G[e][s],w);
        }
        printf("%d\n",prim(v));
    }
}

#include<cstdio>
#include<algorithm>
const int N=20010;
int parent[N];
struct Edge
{
    int s,e,dis;
    bool operator<(const Edge &b)const{
    return dis<b.dis;
    }
}edge[N];
int find(int x){
    return x==parent[x]?x:find(parent[x]);
}
int kruskal(int n)
{
    int ans=0;
    for(int i=0;i<N;++i)parent[i]=i;
    std::sort(edge,edge+n);
    for(int i=0;i<n;++i){
        int x=find(edge[i].s);
        int y=find(edge[i].e);
        if(x!=y){
            ans+=edge[i].dis;
            parent[y]=x;
        }
    }
    return ans;
}
int  main()
{
    int n,s,e,k,dis;
    while(scanf("%d",&n),n){
        k=0;n=n*(n-1)/2;
        for(int i=0;i<n;++i){
            scanf("%d %d %d",&s,&e,&dis);
            edge[k].s=s;
            edge[k].e=e;
            edge[k].dis=dis;
            edge[++k].e=s;
            edge[k].s=e;
            edge[k++].dis=dis;
        }
        printf("%d\n",kruskal(k));
    }
}