并查集应用——Kruskal（最小生成树）C++

生成树：连通图的极小连通子图

最小生成树：生成树中权值最小的那棵。

并查集：用来判断每次新加入边的顶点是否已经存在于正在建立的最小生成树集合中，若已包含，舍去；否则加入进行合并。

#include "test.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAXN = 1000;

struct Edge{
    int from;
    int to;
    int length;
    bool operator <(const Edge& e) const{
        return length < e.length;
    }
};

Edge edge[MAXN*MAXN];
int father[MAXN];
int height[MAXN];

void Initial(int n ){
    for (int i = 0; i < n; ++i) {
        father[i] = i;
        height[i] = 0;
    }
}

int Find(int x){
    if (x!=father[x]){
        father[x] = Find(father[x]);
    }
    return father[x];
}

void Union(int x,int y){
    x=Find(x);
    y = Find(y);
    if (x!=y){
        if (height[x] < height[y]){
            father[x] = y;
        } else if(height[x] > height[y]){
            father[y] = x;
        } else {
            father[y] = x;
            height[x]++;
        }
    }
}

int Kruskal(int n,int edgeNumber){
    Initial(n);
    Sort(edge,edge + edgeNumber);
    int sum = 0;
    for (int i = 0; i < edgeNumber; ++i) {
        Edge current = edge[i];
        if (Find(current.from) != Find(current.to)){
            Union(current.from,current.to);
            sum += current.length;
        }
    }
    return sum;
}

int main(){
    int n,m;
    while (scanf(" %d%d",&n,&m)!=EOF){
        if (n == 0){
            break;
        }
        int edgeNumber = n*(n-1)/2;
        for (int i = 0; i < edgeNumber; ++i) {
            scanf("%d%d%d",&edge[i].from,&edge[i].to,&edge[i].length);
        }
        int answer = Kruskal(n,edgeNumber);
        printf("%d\n",answer);
    }
    return 0;
}