带路径压缩的并查集模板
作者:cornerCao
链接:https://www.acwing.com/blog/content/205/
来源:AcWing
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
vector<int> father;
void init(int x){//防止father是空的数组 x是元素个数
for(int i = 0; i < x; i++){
father.push_back(i);
}
}
int findFather(int x){
if(father[x]==x) return x;
father[x] = findFather(father[x]);
return father[x];
}
void union(int x, int y){
x = findFather(x);
y = findFather(y);
father[x] = y;
}