并查集学习

/*
* File name  : ufs01.cpp
* Function   : 并查集学习
* Created on : 2016年6月6日
* 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

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

#pragma warning(disable:4996)

using namespace std;

#define MAX 100

typedef struct{
    int x;
    int y;
}Clue;

Clue clue_array[MAX];
int  result_array[MAX];

int  get_boss(int x); //获取 X的大 boss
void  set_boss(int x,int boss);
bool is_one_union(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++)
    {
        result_array[i] = i;
    }

    for (int i = 1; i <= clue_num; i++)
    {
        cout << "请输入 第 " << i << "条信息: " << endl;
        cin >> clue_array[i].x >> clue_array[i].y;
    }
    /************************************************************************************************/
    int bossx = 0, bossy = 0;
    for (int k = 1; k <= clue_num; k++)
    for (int i = 1; i <= clue_num; i++)
    {
        bossx = get_boss(clue_array[i].x);
        bossy = get_boss(clue_array[i].y);
        if (bossx != bossy)// 如果 x, y的boss 不是同一个 boss, 靠左 原则,左边为boss
        {

            set_boss(clue_array[i].y, bossx);
           // set_boss(clue_array[i].x, bossx);
        }
    }
    /************************************************************************************************/
    for (int i = 1; i <= man_num; i++)
    {
        if (i == result_array[i])
        {
            ret++;
        }
    }
    cout << "一共有 " << ret << " 个团伙." << endl;

    cout << "请输入两个人的编号 : " << endl;
    int x, y;
    cin >> x>> y;
    cout << "这两个人是同一团伙 ? " << is_one_union(x, y) << endl;
    return 0;
}


int  get_boss(int x) //获取 X的大 boss
{
    int boss;
    if (result_array[x] != x)
    {
        boss= get_boss(result_array[x]);
        result_array[x] = boss;
    }
    else{
        boss= result_array[x];
    }
    return boss;
}

void  set_boss(int x, int boss)
{
    if (result_array[x] == x)
    {
        result_array[x] = boss;
    }
    else{
        set_boss(result_array[x], boss);
        result_array[x] = boss;
    }
}

bool is_one_union(int x, int y)
{
    if (result_array[x] == result_array[y])
        return true;
    else
        return false;
}