并查集的简单应用（最小生成树）

求解最小生成树

Kruskal算法(并查集的应用)

参考来自

#include <bits/stdc++.h>
using namespace std;
//并查集算法
class Pre
{
    int n, pre[1000];
    //是否启用路径压缩
    bool path_zip = false;

public:
    Pre(int n, bool Path_zip = true)
    {
        this->n = n;
        for (int i = 0; i < n; ++i)
            pre[i] = i;
        this->path_zip = Path_zip;
    }
    //查询父节点
    int find(int x)
    {
        int r = x;
        //查询父节点
        while (pre[r] != r)
            r = pre[r];
        int i = x, j;
        //路径压缩算法
        if (path_zip)
        {
            while (i != r)
            {
                j = pre[i];
                pre[i] = r;
                i = j;
            }
        }
        return r;
    }
    //创建链接关系，返回链接是否创建成功（插入是否产生回路）
    bool join(int x, int y)
    {
        int fx = find(x), fy = find(y);
        if (fx != fy)
        {
            pre[fx] = fy;
            return true;
        }
        return false;
    }
    //显示所有节点的父级节点
    void Show()
    {
        for (int i = 0; i < n; ++i)
        {
            printf("节点%d的父节点为%d\n", i, pre[i]);
        }
    }
};
//储存图的邻接关系
struct Node
{
    int x, y;
    int value;
};
//贪心算法排序
bool Function(Node A, Node B)
{
    return A.value < B.value;
}
// 6
// 4
// 0 1 1
// 0 2 3
// 0 3 2
// 3 1 1
// 2 3 4
// 2 1 1
int main()
{
    Node Map[1000];
    int n, x, y, value, m;
    bool Success = false;
    cout << "输入边数：";
    cin >> m;
    cout << "输入节点数：";
    cin >> n;
    Pre SET = Pre(n, false);
    for (int i = 0; i < m; ++i)
    {
        cin >> x >> y >> value;
        Map[i].x = x;
        Map[i].y = y;
        Map[i].value = value;
    }
    int Count = 0;
    //贪心算法
    sort(Map, Map + m, Function);
    for (int i = 0; i < m; ++i)
    {
        if (SET.join(Map[i].x, Map[i].y))
            Count += Map[i].value;
        else
        {
            printf("节点：%d与节点：%d重复链接，权重：%d\n", Map[i].x, Map[i].y, Map[i].value);
        }
    }
    SET.Show();
    cout << "最短连通路径和:" << Count;
    system("pause");
}