hdu Eddy's pitrue prim and kruskal

点击打开链接

Prim

#include<stdio.h>
#include<math.h>
#include<string.h>
double dis[110][110];
double lowcost[110];
int n;

struct node
{
    double x;
    double y;
}list[110];

double fun(double x1,double x2,double y1,double y2)
{
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}

double prim()
{
    int j,z;
    int visit[110];
    memset(visit,0,sizeof(visit));
    int yes;
    double min,sum=0.0;
    visit[1]=1;
    for(;;)
    {
        min=1000000.0;
        yes=-1;
        for(j=1;j<=n;j++)
        {
            if(lowcost[j]<min && !visit[j])
            {
                min=lowcost[j];
                z=j;
                yes=1;
            }
        }
        if(yes==-1) break;
        visit[z]=1;
        sum+=min;
//        printf("%lf ",sum);
        for(j=1;j<=n;j++)
            if(lowcost[j]>dis[z][j] && !visit[j])
                lowcost[j]=dis[z][j];
    }
    return sum;
}

int main()
{
    int i,j;
    double x,y;
    while(scanf("%d",&n)!=EOF)
    {
        memset(lowcost,0,sizeof(lowcost));
        memset(dis,0,sizeof(dis));
        for(i=1;i<=n;i++)
        {
            scanf("%lf%lf",&x,&y);
            list[i].x=x;
            list[i].y=y;
        }
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
            {
                 dis[i][j]=fun(list[i].x,list[j].x,list[i].y,list[j].y);
//                 printf("%lf ",dis[i][j]);
            }
        for(i=1;i<=n;i++) 
            lowcost[i]=dis[1][i];
        printf("%.2lf\n",prim());
    }
    return 0;
}

Kruskal

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
double sum;
int coun;

struct node
{
	int strat,end;
	double len;
}list[11000];
bool cmp(node a,node b)
{
	return a.len < b.len ;
}

int father[11000];

int find(int a)
{
	if(a==father[a]) return a;
	else return find(father[a]);
}

void bing(int a,int b)
{
	father[find(a)]= father[find(b)];
}

int main()
{
	int n,i,j;
	double x[110],y[110];
	while(scanf("%d",&n)!=EOF)
	{
		for(i=1;i<=n;i++)
			scanf("%lf%lf",&x[i],&y[i]);
		coun=0;
		for(i=1;i<n;i++)
			for(j=i+1;j<=n;j++)
			{
				coun++;
				list[coun].strat = i;
				list[coun].end = j;
				list[coun].len = sqrt(pow((x[i]-x[j]),2)+pow((y[i]-y[j]),2));
			}
		for(i=1;i<=coun;i++) father[i]=i;
		sort(list+1,list+coun+1,cmp);
		sum=0;
		for(i=1;i<=coun;i++)
			if(find(list[i].strat ) != find(list[i].end ))
			{
				bing(list[i].strat ,list[i].end );
				sum+=list[i].len ;
			}
		printf("%.2lf\n",sum);
	}
	return 0;
}

这里就只直接给出代码了，想要了解得更多，建议百度。