package middle;
import java.io.BufferedInputStream;
import java.util.Scanner;
/**
* poj1308
* 判断是否是一棵只有一个根,并且到每个结点的路径唯一的树
* 多种解法,这里用并查集
* 1.空树也是一棵树
* 2.不是同一棵树就合并,输入的边的两个顶点同根,说明有环
* 3.注意,森林不是一棵树
* @author NC
*/
public class Poj1308 {
public static void main(String[] args) {
final int MAXSIZE = 10000;
int[] edge1 = new int[MAXSIZE];
int[] edge2 = new int[MAXSIZE];
Scanner scan = new Scanner(new BufferedInputStream(System.in));
String r1 = "is a tree.";
String r2 = "is not a tree.";
int caseI = 1;//记录case
int root = 0;//查是否是森林用的
while (scan.hasNext()) {
int a = scan.nextInt();
int b = scan.nextInt();
if (a == -1 && b == -1) {
break;
}
int j = 0;
//先读取每一个case的所有边再处理,方便判断空树
for (j = 0;; j++) {
if (a == 0 && b == 0) {
break;
}
edge1[j] = a;
edge2[j] = b;
a = scan.nextInt();
b = scan.nextInt();
}
if (j == 0) {
//空树
System.out.println("Case " + caseI + " " + r1);
caseI++;
} else {
String result = "";
boolean resultFlag = true;
DisjointSet dj = new DisjointSet(MAXSIZE);
for (int jj = 0; jj < j; jj++) {
if (dj.parent[edge1[jj]] == 0) {
dj.init(edge1[jj]);
}
if (dj.parent[edge2[jj]] == 0) {
dj.init(edge2[jj]);
}
root = edge1[jj];
int ra = dj.find(edge1[jj]);
int rb = dj.find(edge2[jj]);
if (ra == rb) {
//有环,不是一棵按要求的树
resultFlag = false;
break;//一发现环就可以直接输出结果,输入的,前面已经处理了
} else {
dj.union(ra, rb);
}
}
result = "Case " + caseI + " ";
if (resultFlag) {
int k;
for (k = 0; k < MAXSIZE; k++) {
if (dj.parent[k] != 0) {
if (dj.find(k) != dj.find(root)) {
result += r2;
break;
}
}
}
if (k == MAXSIZE) {
result += r1;
}
} else {
result += r2;
}
System.out.println(result);
caseI++;
}
}
}
}
class DisjointSet {
protected int n;
protected int[] parent;
protected int[] rank;
public DisjointSet(int n) {
this.n = n;
init();
}
private void init() {
this.parent = new int[this.n + 1];
this.rank = new int[this.n + 1];
}
protected void init(int i) {
parent[i] = i;
rank[i] = 1;
}
protected int find(int x) {//返回第x号元素的根结点
if (parent[x] != x) {
parent[x] = find(parent[x]);
}
return parent[x];
}
protected void union(int ra, int rb) {
if (rank[ra] > rank[rb]) {
parent[rb] = ra;
} else if (rank[ra] < rank[rb]) {
parent[ra] = rb;
} else {
rank[rb]++;
parent[ra] = rb;
}
}
}
Poj1308 并查集
最新推荐文章于 2021-10-28 21:54:09 发布