生成树:一个联通图中还有n个顶点但却只有n-1条边
最小生成树:权值最小的生成树
kruskal算法:并查集思想
1.n个顶点 连接n-1个边
2.采用快排选出最小的边
模板代码:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
const int maxn = 2e5 + 10;
int u, v;
long long sum;
int f[maxn];
int ans;
struct Node
{
int x, y, z;
}edge[maxn];
bool cmp(Node x, Node y)
{
return x.z < y.z;
}
int get(int x)
{
return x == f[x] ? x : f[x] = get(f[x]);
}
int main()
{
ans = 0;
sum = 0;
int n, m;
scanf("%d%d", &n, &m);//n个顶点 m条边
for (int i = 1; i <= m; ++i)
{
scanf("%d%d%d", &edge[i].x, &edge[i].y, &edge[i].z);
}
for (int i = 0; i <= n; ++i)
{
f[i] = i;
}
for (int i = 1; i <= m; i++)
{
int x = get(edge[i].x);
int y = get(edge[i].y);
if (x == y) { continue; }
f[y] = x;
sum += edge[i].z;
}
for (int i = 0; i <= n; i++)
{
if (i == f[i]) { ans++; }//说明有孤立点 无法生成树
}
if (!ans) { puts("Impossible"); }
else { printf("%lld\n", sum); }
}