树8 File Transfer

#include <iostream>
#include <string>
using namespace std;

#define MaxNum 10001

int Find( int arrSet[], int X );
void ConnectSet( int arrSet[], int c1, int c2 );
string CheckConnection( int arrSet[], int c1, int c2 );
int CountComponentNum( int arrSet[], int num );

//使用数组保存集合元素，数组下标对应元素值，数组元素对应parent值

int main()
{
    int nodeNum;
    int *arrSet;
    cin >> nodeNum;
    nodeNum += 1;    //由于数组下标0用于标记根结点，因此使用数组下标从1开始
    arrSet = new int[ nodeNum ];    //parent == 0 -> root, parent == -1 -> NULL
    int i;
    for ( i = 0; i < nodeNum; i++ )
    {
        arrSet[i] = -1;
    }
    
    int c1;
    int c2;
    string operationName;
    string checkResult = "";
    int componentNum;
    while( true )
    {
        cin >> operationName;
        if ( operationName == "S" )
        {
            break;
        }
        cin >> c1 >> c2;
        if ( operationName == "I" )
        {
            ConnectSet( arrSet, c1, c2 );
        }
        else if ( operationName == "C" )
        {
            checkResult += CheckConnection( arrSet, c1, c2 );
        }
    }
    cout << checkResult;
    componentNum = CountComponentNum( arrSet, nodeNum );
    if ( componentNum == 1 )
    {
        cout << "The network is connected." << endl;
    }
    else
    {
        cout << "There are " << componentNum << " components." << endl;
    }
}

int Find( int arrSet[], int X )    //在查找过程中，减少树的高度
{
    if ( X > MaxNum || arrSet[X] == -1 )
    {
        return -1;
    }
    int temp = X;
    int exchange;
    while( arrSet[X] > 0 )
    {
        X = arrSet[X];
    }
    while ( arrSet[arrSet[temp]] > 0 )    //将搜索路径中的所有元素都直接指向根结点
    {
        exchange = temp;
        temp = arrSet[temp];
        arrSet[exchange] = X;
    }
    return X;
}

void ConnectSet( int arrSet[], int c1, int c2 )
{
    int root1, root2;
    if ( arrSet[c1] == -1 )
    {
        arrSet[c1] = 0;
        root1 = c1;
    }
    else
    {
        root1 = Find( arrSet, c1 );
    }
    if ( arrSet[c2] == -1 )
    {
        arrSet[c2] = 0;
        root2 = c2;
    }
    else
    {
        root2 = Find( arrSet, c2 );
    }
    if ( root1 != root2 )
    {
        arrSet[root2] = root1;
    }
}

string CheckConnection( int arrSet[], int c1, int c2 )
{
    int root1, root2;
    root1 = Find( arrSet, c1 );
    root2 = Find( arrSet, c2 );
    if ( root1 == root2 && root1 != -1 && root2 != -1 )
    {
        return "yes\n";
    }
    else
    {
        return "no\n";
    }
}

//计算数组中的集合个数
int CountComponentNum( int arrSet[], int num )
{
    int i;
    int sum = 0;
    int nodeNum = 0;
    for( i = 0; i < num; i++ )
    {
        if ( arrSet[i] >= 0 )    //统计所有结点数量
        {
            nodeNum++;
        }
        if ( arrSet[i] == 0 )    //根结点的数量
        {
            sum++;
        }
    }
    return sum + num - 1 - nodeNum;    //给出的结点数中，可能存在未包含进任何集合的结点                                       //这里-1是由于在一开始将nodeNum加了1,这个处理需要改进
}