+++++++++++++++++++++++++++++++++++++++
+++++++++++++++++++++++++++++++++++++++
- /* father[x]表示x的父节点 */
- int father[MAX];
- /* rank[x]表示x的秩 */
- int rank[MAX];
- /* 初始化集合 */
- void Make_Set(int x)
- {
- father[x] = x;
- rank[x] = 0;
- }
- /* 查找x元素所在的集合,回溯时压缩路径 */
- int Find_Set(int x)
- {
- if (x != father[x])
- {
- father[x] = Find_Set(father[x]);
- }
- return father[x];
- }
- /* 按秩合并x,y所在的集合 */
- void Union(int x, int y)
- {
- x = Find_Set(x);
- y = Find_Set(y);
- if (x == y) return;
- if (rank[x] > rank[y])
- {
- father[y] = x;
- }
- else
- {
- if (rank[x] == rank[y])
- {
- rank[y]++;
- }
- father[x] = y;
- }
- }
+++++++++++++++++++++++++++++++++++++++
相关题目
并查集的基础应用:
POJ 2524 Ubiquitous Religions C语言版
最小生成树Kruskal算法并查集应用:
POJ 1258 Agri-Net C语言版 Kruskal
POJ 1251 Jungle Roads C++版 Kruskal
today lazy . tomorrow die .