B - 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. 

Input

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. 

Output

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). 

Sample Input

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

Sample Output

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

解题思路：本题与上一题相差甚微。只需要加一个判断被指几次的数组以及数清楚到底有几个根（数根：只用在遍历的时候查出有几个是pre[i]=i即可)
                  1.有且只有一个最上层的根节点，它不能被指向。
         2.除此之外所有的节点都只能被指向一次（所以称作有向的图），因此需要再用一个           数组来记录被指向的次数。
         3.依然采用节点数减去线条数等于1，来判断是否会形成回路
          


#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
using namespace std;

#define MAXN 100010
bool Set[MAXN];
int pre[MAXN];
int in[MAXN];
bool flag=1;

int Find(int x) //查 一层一层向上查找父亲
{
    int r=x;
    while(pre[x]!=r)
    {
       r=pre[x];
    }
    return r;
}

void join(int x,int y) //并 把x的父亲设为y
{
    int fx=Find(x),fy=Find(y);
    if(fx!=fy)
    {
        pre[fx]=fy;
    }
    else     //这里是比较创新的一个位置因为说明：如果有一个孤立的节点就直接No了
    {
        flag=0;//围成一个圈
    }
}
int main()
{
    //freopen("d:\\A.txt","r",stdin);
    int a,b;
    int cut=0;//记录有几个 非孤立的节点

    int root_num = 0;
    int k=0;
    memset(Set,0,sizeof(Set));
    memset(in,0,sizeof(in));
    for(int i=1;i<=MAXN;i++)
    {
        pre[i]=i;//把所有的父亲都设为本身
    }
    while(cin>>a>>b)
    {
        if(a==-1&&b==-1)break;
       if(a!=0||b!=0)
       {

           if(Set[a]==0)
           {
               cut++;
               Set[a]=1;//用过了
           }
           if(Set[b]==0)
           {
               cut++;
               Set[b]=1;
           }
           if(a<b)//总是把大的数设为节点，就避免了重复
           {
               join(a,b);//a被指向的次数加1
               in[a]++;
           }
           else
           {
               join(b,a);
               in[b]++;
           }
       }
       else
       {
           k++;
           int n=0;    //记录有几条边
           for(int i=1;i<=MAXN;i++)
           {
               if(pre[i]!=i)//说明已经和别人建立联系的 方法 算出有几根线
               {
                   n++;
               }
               if(in[i]>1)
               {
                   flag=0;
               }
               if(Set[i]==1&&(pre[i]=i))
               {
                   root_num++;
               }
           }
           for(int i=1;i<MAXN;i++)
           {
               pre[i]=i;
               Set[i]=0;           //还原语句，因为不能再回去初始化了
               in[i]=0;
           }

           //cout<<"n:"<<n<<"cut:"<<cut<<"flag"<<flag;
           if(flag && (n==(cut-1)||n==0&cut==0)&& root_num)cout<<"Case "<<k<<" is a tree."<<endl;
           else cout<<"Case "<<k<<" is not a tree."<<endl;
           flag=1;
           cut=0;
           root_num=0;
       }
    }

    return 0;
}
http://www.xukeyang.com/index.php/archives/35/