【kruskal算法】

输入样例:

4 5
1 2 1
1 3 2
1 4 3
2 3 2
3 4 4

输出样例:

6

AC代码:

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N = 100010;
int n, m;
int p[N];
struct Edge {
	int a, b, w;
	bool operator<(const Edge&W) const{
		return w < W.w;
	}
}edges[N];

int find(int x) {
	if (p[x] != x) p[x] = find(p[x]);
	return p[x];
}
int main()
{

	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; i++) {
		int a, b, w;
		scanf("%d%d%d", &a, &b, &w);
		edges[i] = { a,b,w };
	}
	sort(edges, edges + m);
	for (int i = 1; i <= n; i++) p[i] = i;
	int res = 0, cnt = 0;
	for (int i = 0; i < m; i++) {
		int a = edges[i].a, b = edges[i].b, w = edges[i].w;
		a = find(a), b = find(b);
		if (a != b) {
			p[a] = b;
			res += w;
			cnt++;
		}
	}
	if (cnt < n - 1) printf("impossible");
	else printf("%d", res);

	system("pause");
	return 0;
}