并查集的标准实现

<pre name="code" class="cpp">/*
* File name  : ufs02.cpp
* Function   : 并查集学习
* Created on : 2016年6月7日
* Author     : beijiwei@qq.com
* Copyright  : 欢迎大家和我一起交流学习，转载请保持源文件的完整性。
任何单位和个人不经本人允许不得用于商业用途

input:
10 9
1 2
3 4
5 2
4 6
2 6
8 7
9 7
1 6
2 4

*/
#include <cstdio>
#include <iostream>

#pragma warning(disable:4996)

using namespace std;

#define MAX 100

int boss[MAX];
int find_boss(int x);
void join(int x, int y);

int main(int argc, char** argv)
{
    int man_num, clue_num, ret = 0;
    freopen("input.txt", "r", stdin);

    cin >> man_num >> clue_num;
    for (int i = 1; i <= man_num; i++)
    {
        boss[i] = i;
    }
    for (int i = 1; i <= clue_num; i++)
    {
        int tmpx, tmpy;
        cin >> tmpx >> tmpy;
        join(tmpx, tmpy);
    }

    for (int i = 1; i <= man_num; i++)
    {
        if (boss[i] == i)
            ret++;
    }
    cout << "一共有 " << ret << " 个团伙." << endl;
    return 0;
}

int find_boss(int x)
{
    int tmp;
    if (boss[x] == x)
    {
        tmp= x;
    }else{
        tmp = find_boss(boss[x]);
        boss[x] = tmp;
    }
    return tmp;
}
void join(int x, int y)
{
    int bossx, bossy;
    bossx = find_boss(x);
    bossy = find_boss(y);
    if (bossx != bossy)
    {
        boss[bossy] = bossx;
        find_boss(y);
    }
}