并查集算法c语言版,并查集实现(C语言)

实现了最基本的并查集,可以用宏 path_compress 开关路径压缩.

#include

#include

#include

#define MAXNUM 20

int parent[MAXNUM];

int find_set(int x)

{

int ret = x;

#define path_compress 1

#if path_compress

//递归,带路径压缩

if ( x!=parent[x])

{

parent[x] = find_set(parent[x]);

}

#else

// 递推,非路径压缩

while (ret != parent[ret])

{

ret = parent[ret];

}

#endif

return parent[x];

}

int union_set(int a, int b)

{

int rootA = find_set(a);

int rootB = find_set(b);

if (rootA == rootB)

{

return 0;

}

// 合并后的集合编号取较小者

if (a < b)

parent[b] = a;

else

parent[a] = b;

return 0;

}

int main(int argc, char** argv)

{

int i, a, b;

for(i = 0; i < 20; ++i)

{

parent[i] = i;

}

freopen("test_unionset.in", "r", stdin);

while(EOF != scanf("%d %d", &a, &b))

{

union_set(a, b);

printf("set of %d and %d is %d\n", a, b, find_set(a));

}

printf("============================\n");

for(i = 0; i < 20; ++i)

{

printf("%-3d", i);

}

printf("\n");

for(i = 0; i < 20; ++i)

{

printf("%-3d",  find_set(i) );

}

printf("\n");

return 0;

}