Kruscal算法模板

/*时间复杂度:o(eloge),贪心策略：边权值从小到大找*/
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#define N 100005

using namespace std;

typedef struct note {
	int u; int v; int w;
}edge;

edge e[N];
int n, m;//分别表示顶点数和边数
int sum = 0, cnt = 0;
int f[N] = { 0 };

int cmp(edge a, edge b)//升序排列
{
	return a.w < b.w;
}

void init()
{
	sum = 0; cnt = 0;
	for (int i = 1; i <= n; i++)
		f[i] = i;
}

int find(int x)//找父节点
{
	if (f[x] == x) return x;
	else return f[x] = find(f[x]);
	
}

int merge(int x, int y)
{
	int t1, t2;
	t1 = find(x);
	t2 = find(y);
	if (t1 != t2)//根不一样
	{
		f[t2] = t1;
		return 1;
	}
	return 0;
}

int kru()
{
	for (int i = 0; i < m; i++)
	{
		if (merge(e[i].u, e[i].v))//如果可以合并不形成回路
		{
			sum += e[i].w;//权值累加   
			cnt++;//边数累加
		}
		if (cnt == n - 1) break;//直接用了n-1条边
	}
	if (cnt < n - 1)	return -1;//图不连通
	else return sum;
}

int main()
{
	while (scanf("%d%d", &n, &m) != EOF)
	{
		int ans = 0;
		init();//初始化
		for (int i = 0; i < m; i++)//输入边
			scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w);
		sort(e, e + m, cmp);//边按权值照升序排列
		ans = kru();
		if(ans==-1) printf("图不连通\n");
		else printf("%d\n", ans);
	}
	return 0;
}