并查集-实现-kruscal-最小生成树-模板-源码

#include <iostream>
#include<algorithm>
using namespace std;
const int N=1000;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */

//收集边集
struct EDGE{
	int u,v,cost;
	void set(int a,int b,int w){
		u=a;
		v=b;
		cost=w;
	}
};

//无向图的边数最大值
EDGE edge[N*N-1/2];

//排序因子
bool cmp(EDGE a, EDGE b){
	return a.cost<b.cost;
}

******************************************
//以下就是并查集的三个的组成部分

//1.father数组
int father[N];

//2.寻找父结点
int find(int x){
	if(father[x]==-1){
		return x;
	}else{
		return father[x]=find(father[x]);
	}
} 

//3.合并函数
bool union1(int x ,int y){
	x=find(x);
	y=find(y);
	if(x==y){
		return false;
	}
	if(x>y){
		father[x]=y;
	}else{
		father[y]=x;
	}
	return true;
}
******************************************
int main(int argc, char *argv[]) {
	int i;
	int v,w,cost;
	cout<<"请输入边数和顶点数:"<<endl;
	int m,t;
	cin>>m>>t;	
	cout<<"请输入边的信息 例如 1 2 10："<<endl; 
	for(i=0;i<m;i++){
		cin>>v>>w>>cost;
		edge[i].set(v,w,cost);
	}
	sort(edge,edge+m,cmp);
	i=0;
	fill(father,father+m,-1);
	int sum=0,count=0;
	while(count!=t-1){
		if(union1(edge[i].u,edge[i].v)){
			cout<<edge[i].u<<"-"<<edge[i].v<<endl;
			sum+=edge[i].cost;
			count++;
		}
		i++;
	}
	cout<<"sum:"<<sum <<endl;
	return 0;
}