[POJ2421]最小生成树+PRIM+KRUSKAL

【题目】http://poj.org/problem?id=2421

【思路1】如果是用PRIM将已经修好路的两点之间的距离记做0就好

【代码】：

#include <cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define size 105
#define MAX 10000
int array[size][size];
int i,k,num,a,b,n,sum;
int low[size];
bool flag[size];
int Prim(int n)
{	memset(flag,false,sizeof(flag));
	memset(low,0,sizeof(low));
	sum=0;
	flag[0] = true;
    for(i = 1; i < n; i++)low[i] = array[0][i];
	for(i=1;i<n;i++)
	{
        int min = MAX;
        int j = 0;
        for(k = 1; k < n; k++)
            if( low[k] < min && flag[k]==false )
            {
                min = low[k];
                j = k;
            }
        sum += min;
        flag[j] = true;
        for(k = 1; k < n; k++)
		{
            if(array[j][k] < low[k] && flag[k]==false)
                low[k] = array[j][k];
		}
    }
    return sum;
}
int main()
{	
	scanf("%d",&num);
		memset(array,0,sizeof(array));
		for(k = 0; k < num; k++)
			for(int j = 0; j < num; j++)
				scanf("%d",&array[k][j]);
		for(k=0;k<num;k++)
		array[k][k]=MAX;
		scanf("%d",&n);
		for(i=0;i<n;i++){
			scanf("%d%d",&a,&b);
			array[a-1][b-1]=array[b-1][a-1]=0;
		}
		printf("%d\n",Prim(num));
    return 0;
}

【思路2】：话说这道题用KRUSKAL比较容易想到，因为KRUSKAL是用到的并查集

所以在处理的时候处理并查集就好了...【才不说是因为prim没有想到呢

#include<cstdio>
#include<cstring>
#include<iostream>
#include<stdlib.h>
#define MAX 5000
using namespace std;
typedef struct _edge
{
    int x,y;
    int weight;
};

struct _edge edge[MAX];
int father[MAX];
int rank[MAX];
int sum;
int n,m,i,j,cnt,tmp,x,y,a,b;

int cmp(const void *a,const void *b)
{
    return (*(struct _edge*)a).weight>(*(struct _edge*)b).weight?1:-1;
}
int Find_Set(int x)
{
    if(x!=father[x])
        father[x]=Find_Set(father[x]);
    return father[x];
}
void Union_Set(int x,int y,int w)
{
    a = Find_Set(x);
    b = Find_Set(y);
    if(a==b)return;
    if(rank[x]>rank[y])
        father[b]=a;
    else
    {
        father[a]=b;
        if(rank[x]==rank[y])rank[x]++;
    }
    sum+=w;
}
int main()
{
    scanf("%d",&n);
    memset(rank,0,sizeof(rank));
    sum=0;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
        {
            if(i<j)
            {
                edge[cnt].x=i;
                edge[cnt].y=j;
                scanf("%d",&edge[cnt].weight);
                cnt++;
            }
            else scanf("%d",&tmp);
        }
    scanf("%d",&m);
    qsort(edge,cnt,sizeof(edge[0]),cmp);
    for(i=0; i<MAX; i++)
        father[i]=i;
    for(int i=0; i<m; i++)
    {
        scanf("%d%d",&a,&b);
        Union_Set(a,b,0);
    }//话说这里修改并查集的地方修改了好久...马一下用于复习OTZ...
    for(i=0; i<cnt; i++)
    {
        Union_Set(x,y,edge[i].weight);
    }
    printf("%d",sum);
}