并查集，union-find sets

《挑战程序设计竞赛》，初级篇–树

// union-find sets
#include <iostream>
#include <cstdio>
using namespace std;
#define maxv 110

int par[maxv];
int rank[maxv];

void init_union_find_sets(int n)
{
    for(int i = 0; i < n; i++)
    {
        par[i] = i;
        rank[i] = 0;
    }
}

// find()
int find(int x)
{
    if(par[x] == x)
        return x;
    else
        return par[x] = find(par[x]);
}

// unite()
void unite(int x, int y)
{
    x = find(x);
    y = find(y);
    if(x == y) return ;

    if(rank[x] < rank[y])
        par[x] = y;
    else
        par[y] = x;
        if(rank[x] == rank[y]) rank[x]++;
}

bool same(int x, int y)
{
    return find(x) == find(y);
}

int main()
{
    int n;
    cin>>n;
    init_union_find_sets(n);

    cout<<"-----"<<endl;
    cout<<find(0)<<endl;
    cout<<find(1)<<endl;
    cout<<find(2)<<endl;
    cout<<"-----"<<endl;
    unite(0,1);
    cout<<same(0,1)<<endl;
    cout<<same(0,2)<<endl;
    cout<<"-----"<<endl;
    cout<<find(1)<<endl;
    cout<<find(2)<<endl;
}