Kruskal算法模版

1.例如：求解如图的最小生成树

求解过程：

方法一：一般做法（最终都是在避环）
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxx=105;
const int inf=0x3f3f3f3f;
int pre[maxx];
int rank[maxx];
struct node{
	int u,v;
	int cost;
}e[maxx];
int cmp(node a,node b){
	return a.cost<b.cost;
}
int mincost;
int n,m;
int flag[maxx];
void init(){
	mincost=0;
	for(int i=1;i<=n;i++){
		pre[i]=i;
	}
	memset(flag,0,sizeof(flag));
	memset(rank,0,sizeof(rank));
}
void Kruskal(){
	mincost=0;
	int cnt=0;
	int i=1;
	while(cnt<n){
		if(flag[e[i].u]==0&&flag[e[i].v]==0){
			mincost+=e[i].cost;
			cnt++;
			flag[e[i].u]=1;flag[e[i].v]=1;
			pre[e[i].u]=pre[e[i].v];
		}else if(flag[e[i].u]==0&&flag[e[i].v]==1){
			cnt++;
			mincost+=e[i].cost;
			flag[e[i].u]=1;
			pre[e[i].u]=pre[e[i].v];
		}else if(flag[e[i].u]==1&&flag[e[i].v]==0){
			cnt++;
			mincost+=e[i].cost;
			flag[e[i].u]=1;
			pre[e[i].v]=pre[e[i].u];
		}else{
			if(pre[e[i].u]!=pre[e[i].v]){
				mincost+=e[i].cost;
				cnt++;
				int temp=pre[e[i].v];
				for(int j=1;j<=n;j++){
					if(pre[j]==temp){
						pre[j]=pre[e[i].u];
					}
				}
			}
		}
		i++;
	}
	cout<<"最短路: "<<mincost<<endl;
}
int main(){
	while(scanf("%d %d",&n,&m)!=EOF){
		init();
		for(int i=1;i<=m;i++){
			scanf("%d %d %d",&e[i].u,&e[i].v,&e[i].cost);
		}
		sort(e+1,e+m+1,cmp);
		Kruskal();
	}
	return 0;
} 
/*
6 10
1 2 6
1 3 1
1 4 5
2 3 5
2 5 3
3 5 6
5 6 6
3 6 4
3 4 5
4 6 2
*/

方法二：并查集模版
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxx=105;
const int inf=0x3f3f3f3f;
int pre[maxx];
int rank[maxx];
struct node{
	int u,v;
	int cost;
}e[maxx];
int cmp(node a,node b){
	return a.cost<b.cost;
}
int mincost;
int n,m;
void init(){
	for(int i=0;i<maxx;i++){
		pre[i]=i;
		rank[i]=0;
	}
}
int find(int x){
	int r=x;
	if(pre[x]==r){
		return x;
	}
	return pre[x]=find(pre[x]);
}
void unio(int x,int y){
	int fx=find(x);
	int fy=find(y);
	if(rank[fx]<rank[fy]){
		pre[fx]=fy;
	}else{
		pre[fy]=fx;
		if(rank[fx]==rank[fy]){
			rank[fx]++;
		}
	}
}
void Kruskal(int m){
	mincost=0;
	int cnt=0;
	for(int i=1;i<=m;i++){
		int x=find(e[i].u);
		int y=find(e[i].v);
		if(x!=y){
			mincost+=e[i].cost;
			unio(x,y);
			cnt++;
		}
		if(cnt==n-1)break;
	}
	cout<<"最短路: "<<mincost<<endl;
}
int main(){
	while(scanf("%d %d",&n,&m)!=EOF){
		init();
		for(int i=1;i<=m;i++){
			scanf("%d %d %d",&e[i].u,&e[i].v,&e[i].cost);
		}
		sort(e+1,e+m+1,cmp);
		Kruskal(m);
	}
	return 0;
} 
/*
6 10
1 2 6
1 3 1
1 4 5
2 3 5
2 5 3
3 5 6
5 6 6
3 6 4
3 4 5
4 6 2
*/