PAT甲级1021. Deepest Root (25)

A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the deepest root.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (<=10000) which is the number of nodes, and hence the nodes are numbered from 1 to N. Then N-1 lines follow, each describes an edge by given the two adjacent nodes’ numbers.
Output Specification:
For each test case, print each of the deepest roots in a line. If such a root is not unique, print them in increasing order of their numbers. In case that the given graph is not a tree, print “Error: K components” where K is the number of connected components in the graph.
Sample Input 1:
5
1 2
1 3
1 4
2 5
Sample Output 1:
3
4
5
Sample Input 2:
5
1 3
1 4
2 5
3 4
Sample Output 2:
Error: 2 components

求树的最长路（直径）问题：
1.用邻接表储存题目所给的图；
2.用并查集判断连通分量的个数，如果大于1，就不是树，输出错误信息和连通分量的个数。
3.如果是树，就求该树的直径：从树上的任意结点v出发，用DFS/BFS找到距v最远的点w（可能不止一个），w 即是直径上的一个端点；再以 w 为起点再次DFS/BFS，可以找到直径上的其他端点。

> 证明：
设树上有一条直径ST。需要证明的是：从树上的任意结点v出发，找到的w一定是直径的端点。
分情况讨论：
1）如果v在ST路径上，如果找到的w不是S或T，即
=>distance(v,w