POJ2421(prim)

题意：修路，求出最小花费多少。

一看它的输入形式就知道适合prim而不是kruskal。

注意：题上说有Q条路已经修好，赋值为0即可。

#include<cstdio>
#include<cstring>

#define M 10000
#define inf 0x3f3f3f3f

int n;
int gragh[M][M];
int dis[M],visit[M];

int prim()
{
    int sum = 0;
    for(int i = 1;i <= n; i++)
        dis[i] = gragh[1][i];
    memset(visit,0,sizeof(visit));
    visit[1] = true;
    int Min;
    int pos;
    for(int i = 1;i < n; i++){
        Min = inf;
        for(int j = 1;j <= n; j++){
            if(Min > dis[j] && visit[j] == 0){
                Min = dis[j];
                pos = j;
            }
        }
        sum += dis[pos];
        visit[pos] = true;
        for(int j = 1;j <= n; j++){
            if(dis[j] > gragh[pos][j] && visit[j] == 0)
                dis[j] = gragh[pos][j];
        }
    }
    return sum;
}

int main()
{
 //   freopen("in.txt","r",stdin);
    scanf("%d",&n);
    for(int i = 1;i <= n; i++)
        for(int j = 1;j <= n; j++)
            scanf("%d",&gragh[i][j]);
    int m;
    scanf("%d",&m);
    int a,b;
    for(int i = 1;i <= m; i++){
        scanf("%d%d",&a,&b);
        gragh[a][b] = 0;
        gragh[b][a] = 0;
    }
    int ans = prim();
    printf("%d\n",ans);
    return 0;
}