个人模板 Kruskal 最小生成树

#include <stdio.h>
#include <algorithm>
using namespace std;

const int N = 1e5 + 10;
int n, m;
struct xx{
int u, v, len;
}a
;
int f
;

int Find(int x){
return x == f[x] ? x : (f[x] = Find(f[x]));
}

int Merge(int a, int b){
int aa = Find(a);
int bb = Find(b);
if(aa != bb){
f[aa] = bb;
return 1;
}
return 0;
}

int cmp(xx a, xx b){
return a.len < b.len;
}

int main(){
while(scanf("%d", &n) == 1, n){
scanf("%d", &m);
for(int i = 1; i <= n; i++){
f[i] = i;
}
for(int i = 0; i < m; i++){
scanf("%d%d%d", &a[i].u, &a[i].v, &a[i].len);
}
sort(a, a+m, cmp);
int sum = 1, ans = 0;
for(int i = 0; i < m; i++){
if(Merge(a[i].u, a[i].v)){
ans += a[i].len, sum++;
}
if(sum == n) break;
}
printf("%d\n", ans);
}
}