畅通工程
参考代码:
#include<stdio.h>
#define N 1000
int Tree[N];
int findRoot(int x) {
if(Tree[x] == -1)
return x;
else {
int tmp = findRoot(Tree[x]);
Tree[x] = tmp;
return tmp;
}
}
int main() {
//freopen("in.txt","r",stdin);
int n, m, i, a, b, count;
while(scanf("%d %d",&n,&m) !=EOF && (n != 0)) {
for(i=1; i<=n; i++)
Tree[i] = -1;
count = 0;
while(m--) {
scanf("%d %d",&a,&b);
a = findRoot(a);
b = findRoot(b);
if(a != b)
Tree[b] = a;
}
for(i=1; i<=n; i++) {
if(Tree[i] == -1)
count++;
}
printf("%d\n",count-1);
}
return 0;
}