#最小生成树，prim，kruskal#poj 2560 Freckles 雀斑

题目

求最小生成树

---

分析

prim & kruskal

---

Kruskal代码

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
struct node{int u,v; double w;}e[9901];
double x[101],y[101]; int m,nod,f[101];
double o(double s){return s*s;}
bool cmp(node x,node y){return x.w<y.w;}
int getf(int x){return (f[x]==x)?x:f[x]=getf(f[x]);}
int main(){
    int n,k; double s=0;
    scanf("%d",&n);
    for (int i=1;i<=n;i++){
        scanf("%lf%lf",&x[i],&y[i]);
        f[i]=i; for (int j=1;j<i;j++)
        e[++m].w=sqrt(o(x[i]-x[j])+o(y[i]-y[j])),e[m].u=i,e[m].v=j;//勾股定理
    }
    stable_sort(e+1,e+1+m,cmp);
    while (--n){
    	int k1=getf(e[++nod].u); int k2=getf(e[nod].v);
    	if (k1!=k2) f[k1]=k2,s+=e[nod].w; else n++;
	}
    printf("%.2lf",s); return 0;
}

---

Prim代码

#include <cstdio>
#include <climits>
#include <cmath>
using namespace std;
double a[101][101],lowcost[101],x[101],y[101]; bool v[101];
double o(double s){return s*s;}
int main(){
    int n,k; double min,s=0;
    scanf("%d",&n);
    for (int i=1;i<=n;i++){
        scanf("%lf%lf",&x[i],&y[i]);
        for (int j=1;j<=n;j++)
        if (i!=j){
            double sum=sqrt(o(x[i]-x[j])+o(y[i]-y[j]));//勾股定理
            a[i][j]=sum; a[j][i]=sum;
        }
        lowcost[i]=a[1][i];
    } v[1]=1;
    for (int i=1;i<=n-1;i++){
        min=10001;
        for (int j=1;j<=n;j++)
        if (lowcost[j]<min&&!v[j]){
            min=lowcost[j];
            k=j;
        }
        s+=min;
        v[k]=1;
        for (int j=1;j<=n;j++) if (a[k][j]<lowcost[j]) lowcost[j]=a[k][j];
    }
    printf("%.2lf",s); return 0;
}