并查集:
并查集是一种树型的结构,常常用来处理一些不相交的集合的合并和查询问题。
查找:确定元素所在的集合。
合并:将两个集合合并成一个集合。
查找V所在集合的根节点
int find(int v)<span style="white-space:pre"> </span>
{
return father[v] = father[v] == v ? v : find(father[v]);
}
合并:
void merge(int x,int y)
{
int a =find(x),b = find(y);
if(a != b)
father[a] = b;
}
优化1:
int find(int x)
{
int k,j,r;
r = x;
while(r != father[r])
{
r = father[r];
}
k = x;
while(k != r)
{
j = father[k];
father[k] = r;
k = j;
}
return r;
}
优化2:按rank启发式合并
void merge(int x,int y)
{
int a = find(x),b = find(y);
if (rank[a]) < rank[b])
father[a] = b;
else{
father[b] = a;
if(rank[b] == rank[a])
++rank[a];
}
}
example:
#include <iostream>
using namespace std;
int father[1000];
//int rank[1000] = {0};
int find(int x)
{
int k,j,r;
r = x;
while(r != father[r])
{
r = father[r];
}
k = x;
while(k != r)
{
j = father[k];
father[k] = r;
k = j;
}
return r;
}
void merge(int x,int y)
{
int a =find(x),b = find(y);
if(a != b)
father[a] = b;
}
int main()
{
int N,M;
int a,b;
while(1)
{
cin>>N>>M;
int c = N - 1;
if(N == 0)
break;
for(int i = 1;i <= N;i++)
father[i] = i;
for(int i = 1;i <= M;i++)
{
cin>>a>>b;
if(find(a) != find(b))
{
merge(a,b);
c--;
}
}
cout<<c<<endl;
}
return 0;
}