POJ 1751 Highways G++ kruskal实现 prim未实现

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
//看博友分析    抄博友程序     最小生成树    kruskal实现     prim未实现 
struct nod{
	int x;
	int y;
};
nod da[1000];
struct dian{
	int x;
	int y;
	double zhi;
};
bool cmp(dian a,dian b)
{
	return a.zhi<b.zhi;
}
vector<dian> ve;
double dis(nod a, nod b)
{
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int fa[1000];
int find(int x)
{
	if(fa[x]==-1)
	{
		return x;
	}else
	{
		return fa[x]=find(fa[x]);
	}
}
vector<nod> jg;
bool px(nod a,nod b)
{
	if(a.x==b.x)
	{
		return a.y<b.y;
	}else
	{
		return a.x<b.x;
	}
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>da[i].x>>da[i].y;
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=i+1;j<=n;j++)
		{
			double t=dis(da[i],da[j]);
			ve.push_back((dian){i,j,t});
		}
	}
	sort(ve.begin(),ve.end(),cmp);
	memset(fa,-1,sizeof(fa));
	int m;
	cin>>m;
	for(int i=0;i<m;i++)
	{
		int x,y;
		cin>>x>>y;
		if(find(x)!=find(y))
		{
			fa[find(x)]=find(y);
		}
	}
	for(int i=0;i<ve.size();i++)
	{
		int x=ve[i].x;
		int y=ve[i].y;
		if(find(x)!=find(y))
		{
			fa[find(x)]=find(y);
			jg.push_back((nod){x,y});
		}
	}
	sort(jg.begin(),jg.end(),px);
	//if(jg.size()==0)
	//{
	//	cout<<"empty"<<endl;
	//}else
	{
		for(int i=0;i<jg.size();i++)
		{
			cout<<jg[i].x<<" "<<jg[i].y<<endl;
		}		
	}

	return 0;
}