#include <cstdio>
#include <cstring>
#define N 1005
using namespace std;
int n, m;
int f[N];
void init()
{
for (int i = 1; i <= n; i++)
f[i] = i;
}
int find(int x)
{
return x == f[x] ? x : f[x] = find(f[x]);
}
void merge(int x, int y)
{
int t1 = find(x), t2 = find(y);
if (t1 != t2) f[t2] = t1;
}
int main()
{
while (~scanf("%d", &n) && n)
{
scanf("%d", &m);
init();
int u, v;
for (int i = 0; i < m; i++)
{
scanf("%d%d", &u, &v);
merge(u, v);
}
int ans, sum = 0;
for (int i = 1; i <= n; i++)
if (f[i] == i) sum++;
ans = sum - 1;//至少需修的路的条数 = 连通分量数 - 1。
printf("%d\n", ans);
}
return 0;
}
hdu1232 畅通工程 并查集版题
最新推荐文章于 2019-02-27 01:08:06 发布