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.

用并查集来做

对一般的图，判断是不是一棵树

1.根只有一个，即入度为0的点只有一个

2.除根以外的点入度都为1

特殊的图，比如只有空的图，也是空树

#include"stdio.h"
#include<iostream>

#include<cstring>


using namespace std;
typedef long long ll;
const int maxn=10010;
int father[maxn];//初始时把所有点的father设为-1

int findfather(int x){//找到这个点属于的团

while(father[x]!=-1)x=father[x];

return x;

}
void uni(int a,int b){//合并一条边上的两个点在一个团里
int fa=findfather(a);
int fb=findfather(b);
if(fa!=fb)father[fa]=fb;


}
int vis[maxn]={0};//标记每张图里面是否出现这个点

int in[maxn];//入度
int root=0;//根
int res=0;//如果出现入度>=2，res标记为1
int a,b;
int t=1;
int c=0;
int main(){
	
	//freopen("c://jin.txt","r",stdin);
	fill(father,father+maxn,-1);
	while(cin>>a>>b){
		c++;
		if(a==-1&&b==-1)break;
		uni(a,b);
		in[b]++;
		vis[a]=vis[b]=1;
		
		if(a==b&&a==0){
			if(c==1){//c表示每组数据中出现的边的条数-1，如果只有0 0 表示这是一个空树，也是树
			cout<<"Case "<<t++<<" is a tree."<<endl;
			
			}
			else{
		for(int i=1;i<maxn;i++)
		{if(vis[i]){
		if(in[i]>=2)res=1;
		
		if(in[i]==0)root++;
		}
		
		
		}
		
		if(root==1&&res==0)
		{cout<<"Case "<<t++<<" is a tree."<<endl;
		
		}
		else cout<<"Case "<<t++<<" is not a tree."<<endl;}
		fill(vis,vis+maxn,0);
		c=0;
		fill(father,father+maxn,-1);
		fill(in,in+maxn,0);
		root=0; 
        res=0;
		}
		

	
	
	
	
	}

	//freopen("CON","r",stdin);
	//system("pause");

	return 0;
}