class DisjointSet {
protected int n;
protected int[] parent;
protected int[] rank;
public DisjointSet(int n) {
this.n = n;
init(n);
}
protected void init(int n) {
this.parent = new int[this.n + 1];
this.rank = new int[this.n + 1];
for (int i = 1; i <= n; i++) {
parent[i] = i;
rank[i] = 1;
}
}
protected int find(int x) {
if (parent[x] != x) {
parent[x] = find(parent[x]);
}
return parent[x];
}
protected void union(int ra, int rb) {
if (rank[ra] > rank[rb]) {
parent[rb] = ra;
} else if (rank[ra] < rank[rb]) {
parent[ra] = rb;
} else {
rank[rb]++;
parent[ra] = rb;
}
}
}
|