题目链接：
http://acm.hust.edu.cn/vjudge/contest/123393#problem/M
Description
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.
题意：
判断给出的图是否是一棵树.
题解：
这题跟HDU1272判断联通无环图一模一样，图的有向无向并不造成影响.
(http://www.cnblogs.com/Sunshine-tcf/p/5709544.html).
代码：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#define LL long long
#define eps 1e-8
#define maxn 101000
#define mod 100000007
#define inf 0x3f3f3f3f
#define IN freopen("in.txt","r",stdin);
using namespace std;int fa[maxn];
int _rank[maxn];
bool vis[maxn];void init_set() {for(int i=0; i<maxn; i++) {fa[i] = i;_rank[i] = 0;}
}int find_set(int x) {return fa[x] = (x==fa[x]? x:find_set(fa[x]));
}void unit_set(int x, int y) {vis[x] = vis[y] = 1;x = find_set(x);y = find_set(y);if(_rank[x] < _rank[y]) swap(x, y);fa[y] = x;if(_rank[x] == _rank[y]) _rank[x]++;
}int main(int argc, char const *argv[])
{//IN;int x, y, ans = 1; int ca = 1;init_set();memset(vis, 0, sizeof(vis));while(scanf("%d %d", &x, &y) != EOF && (x!=-1||y!=-1)){if(!x && !y) {int last = -1;for(int i=0; i<maxn; i++) {if(!vis[i]) continue;if(last == -1) last = find_set(i);if(last != find_set(i)) {ans = 0; break;}}if(ans) printf("Case %d is a tree.\n", ca++);else printf("Case %d is not a tree.\n", ca++);ans = 1;init_set();memset(vis, 0, sizeof(vis));continue;}if(find_set(x) == find_set(y)) ans = 0;else unit_set(x, y);}return 0;
}
