hduoj-1301 Jungle Roads(最小生成树-克鲁斯卡尔和普里姆求解）

普里姆求解:

#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<map>
using namespace std;
const int MAX=;
const int INF=;
int n;//村庄数
int G[MAX][MAX],d[MAX];
bool isVisit[MAX]={false};
int prim(){
    fill(d,d+MAX,INF);
    d[]=;
    int ans=;
    for(int i=;i<n;i++){
        int u=-,MIN=INF;
        for(int j=;j<n;j++){
            if(isVisit[j]==false&&d[j]<MIN){
                u=j;
                MIN=d[j];
            }
        }
        if(u==-) return -;
        isVisit[u]=true;
        ans+=d[u];
        for(int v=;v<n;v++){
            if(isVisit[v]==false&&G[u][v]!=INF&&d[v]>G[u][v]){
                d[v]=G[u][v];
            }
        }
    }
    return ans;
}
int main(){
    while(scanf("%d",&n)&&n!=){
        getchar();
        fill(G[],G[]+MAX*MAX,INF);
        int temp1,temp2;
        char c1[],c2[];
        for(int i=;i<n-;i++){
            scanf("%s %d",&c1,&temp1);
            for(int j=;j<temp1;j++){
                scanf("%s %d",&c2,&temp2);
                G[c1[]-'A'][c2[]-'A']=G[c2[]-'A'][c1[]-'A']=temp2;
            }
        }
        int ans=prim();
        printf("%d\n",ans);
    }

    return ;
}

-克鲁斯卡尔:

#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<map>
using namespace std;
const int MAX=;
const int MAXE=;
const int INF=;
int d[MAX],father[MAX];
int n,m=;
bool isVisit[MAX]={false};
struct edge{
    int node1,node2;
    int weight;
}E[MAXE];
bool cmp(edge e1,edge e2){
    return e1.weight<e2.weight;
}
int findFather(int x){
    int a=x;
    while(x!=father[x]){
        x=father[x];
    }
    while(a!=father[a]){
        int temp=a;
        a=father[a];
        father[temp]=x;
    }
    return x;
}
int kruskal(){
    int ans=,num_edge=;
    for(int i=;i<n;i++)
        father[i]=i;
    sort(E,E+m,cmp);
    for(int i=;i<m;i++){
        int f1=findFather(E[i].node1);
        int f2=findFather(E[i].node2);
        if(f1!=f2){
            father[f1]=f2;
            ans+=E[i].weight;
            num_edge++;
            //边数等于顶点数-1结束
            if(num_edge==n-) break;
        }
    }
    if(num_edge!=n-) return -;
    else return ans;
}

int main(){
    while(scanf("%d",&n)&&n!=){
        getchar();
        //fill(G[0],G[0]+MAX*MAX,INF);
        char c1[],c2[];
        int temp1,temp2;
        for(int i=;i<n-;i++){
            scanf("%s %d",&c1,&temp1);
            for(int j=;j<temp1;j++){
                scanf("%s %d",&c2,&temp2);
                E[m].node1=c1[]-'A';
                E[m].node2=c2[]-'A';
                E[m].weight=temp2;
                m++;
            }
        }
        int ans=kruskal();
        printf("%d\n",ans);

    }

    return ;
}