#ifndef _UNION_SET_H_
#define _UNION_SET_H_
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
*This file is about union set operations.
*and the program is c-style,you can transfer it to
*cpp-style.
*you can copy,re-write,sell this program but no need to
*let me know this.but you need copy this comment to your
*program's header comment.
*hujian nankai university
*2016/5/26
*/
#define UNION_SET_MAX_SIZE 1024*10 //the size of union.
//the parent array
int parent[UNION_SET_MAX_SIZE];
//the height of the union tree
int rank[UNION_SET_MAX_SIZE];
//the size of union
int union_size=0;
//initialze the union set
void init_set()
{
int i;
for(i=0;i<union_size;i++){
parent[i]=i;
rank[i]=0;
}
}
//find the root of this tree
int find_set(int x){
if(x==parent[x]){
return x;
}else{
return parent[x]=find_set(parent[x]);
}
}
//union x and y is the root of each tree
void union_set(int x,int y)
{
x=find_set(x);
y=find_set(y);
if(x==y) return;//same tree
if(rank[x]<rank[y]){
//the height x<height y
//then,let the y as the root
parent[x]=y;
}else{
parent[y]=x;
if(rank[x]==rank[y]){
rank[x]++;
}
}
}
//judge if the x and y is the same tree
bool same_set(int x,int y)
{
return find_Set(x)==find_Set(y);
}
#endif //end of union set
///<hujian 2016/5/26>