注意:
1:当为空树的时,也是一棵树。
2:当有回环时,就不是一棵树。
3:当两个节点已经在树里面时,要是两个节点之间还有边要添加,则不是也棵树。
AC代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#define MAX 106
using namespace std;
int father[MAX];
bool mark[MAX];
void Make_Set(){
for(int i=0;i<MAX;i++){
father[i]=i;
mark[i]=false;
}
}
int Find_Set(int x){
if(x!=father[x]) father[x]=Find_Set(father[x]);
return father[x];
}
void Union(int x,int y){
//int xf=Find_Set(x);
//int yf=Find_Set(y);
father[father[y]]=father[father[x]];
}
int a,b,t,root;
bool tree;
int main(){
t=1;
while(~scanf("%d %d",&a,&b),(a!=-1&&b!=-1)){
Make_Set();
tree=true;
root=a;
mark[a]=true;
mark[b]=true;
if(a==0&&b==0){
printf("Case %d is a tree.\n",t++);
continue;
}
if(a==b) tree=false;
else Union(a,b);
while(~scanf("%d %d",&a,&b),(a!=0&&b!=0)){
mark[a]=true;
mark[b]=true;
int af=Find_Set(a);
int bf=Find_Set(b);
if(af==bf) tree=false;
else Union(a,b);
}
for(int i=0;i<MAX;i++){
if(mark[i]==true&&Find_Set(i)!=Find_Set(root)){
tree=false;
break;
}
}
if(tree==true) printf("Case %d is a tree.\n",t++);
else printf("Case %d is not a tree.\n",t++);
}
return 0;
}