C++并查集——Is It A Tree？

题目描述

A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. There is exactly one node, called the root, to which no directed edges point. Every node except the root has exactly one edge pointing to it. There is a unique sequence of directed edges from the root to each node. For example, consider the illustrations below, in which nodes are represented by circles and edges are represented by lines with arrowheads. The first two of these are trees, but the last is not.

In this problem you will be given several descriptions of collections of nodes connected by directed edges. For each of these you are to determine if the collection satisfies the definition of a tree or not.

输入描述:

The input will consist of a sequence of descriptions (test cases) followed by a pair of negative integers. Each test case will consist of a sequence of edge descriptions followed by a pair of zeroes Each edge description will consist of a pair of integers; the first integer identifies the node from which the edge begins, and the second integer identifies the node to which the edge is directed. Node numbers will always be greater than zero and less than 10000.

输出描述:

For each test case display the line "Case k is a tree." or the line "Case k is not a tree.", where k corresponds to the test case number (they are sequentially numbered starting with 1).

示例1

输入

6 8  5 3  5 2  6 4
5 6  0 0

8 1  7 3  6 2  8 9  7 5
7 4  7 8  7 6  0 0

3 8  6 8  6 4
5 3  5 6  5 2  0 0
-1 -1

输出

Case 1 is a tree.
Case 2 is a tree.
Case 3 is not a tree.

代码

/**
判断各点是否符合树的定义可以转换为判断它的入度是否符合要求，根结点的入度为0，而其余
点的入度为1。只要各个结点满足入度要求，只有一个根节点，以及各个结点都属于同一集合，
就可以构成一棵树。
*/
#include<iostream>
#include<cstdio>
using namespace std;
const int MAXN=10000;
int father[MAXN];//父亲结点
int heigth[MAXN];//结点高度
int inDegree[MAXN];//入度
bool visit[MAXN];//标记
void Initial()
{
    for(int i=0;i<MAXN;i++)
    {
        father[i]=i;
        heigth[i]=0;
        inDegree[i]=0;
        visit[i]=false;
    }
}
int Find(int x)//查找根结点
{
    if(x!=father[x])
        father[x]=Find(father[x]);
    return father[x];
}
void Union(int x,int y)//合并集合
{
    inDegree[y]++;
    visit[x]=true;
    visit[y]=true;
    x=Find(x);
    y=Find(y);
    if(x!=y)
    {
        if(heigth[x]<heigth[y])
            father[x]=y;
        else if(heigth[x]>heigth[y])
            father[y]=x;
        else
        {
            father[y]=x;
            heigth[x]++;
        }
    }
    return ;
}
bool IsTree()
{
    bool flag=true;
    int component=0;//连通分量数目
    int root=0;//根结点数目
    for(int i=0;i<MAXN;i++)
    {
        if(!visit[i])
            continue;//把没有输入的结点进行过滤操作
        if(father[i]==i)
            component++;
        if(inDegree[i]==0)
            root++;
        else if(inDegree[i]>1)//入度不满足要求
            flag=false;
    }
    if(component!=1||root!=1)//不符合树定义
        flag=false;
    if(component==0&&root==0)//空集也是树
        flag=true;
    return flag;
}
int main()
{
    int x,y;
    int caseNumber=0;
    Initial();
    while(cin>>x>>y)
    {
        if(x==-1&&y==-1)
            break;
        if(x==0&&y==0)
        {
            if(IsTree())
                printf("Case %d is a tree.\n",++caseNumber);
            else
                printf("Case %d is not a tree.\n",++caseNumber);
            Initial();
        }
        else
        {
            Union(x,y);
        }
    }
    return 0;
}