File size: 2,199 Bytes
c574d3a |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 |
package torea;
class UnionFind
{
public static class QuickFind implements IUnionfind{
public int count;
public int[] id;
QuickFind(int some_count){
count = some_count;
id = new int[some_count];
for(int i = 0; i<id.length; i++) id[i] = i;
}
@Override
public int find(int a) {
return id[a];
}
@Override
public boolean connected(int a, int b) {
return id[a] == id[b];
}
@Override
public void union(int a, int b) {
int id_a = find(a);
int id_b = find(b);
if (id_a == id_b) return;
int min_id = (id_a <= id_b) ? id_a: id_b;
int max_id = (id_a > id_b) ? id_a: id_b;
for(int i = 0; i < id.length; i++){
if (id[i] == max_id)
id[i] = min_id;
}
count--;
}
@Override
public int count() {
return count;
}
}
public static class QuickUnion implements IUnionfind{
public int count;
public int[] id;
QuickUnion(int some_count){
count = some_count;
id = new int[some_count];
for(int i = 0; i<id.length; i++) id[i] = i;
}
@Override
public int find(int a) {
if (a == id[a]) return a;
id[a] = find(id[a]);
return id[a];
// while ( a != id[a]) a = id[a];
// return a;
}
@Override
public boolean connected(int a, int b) {
return find(a) == find(b);
}
@Override
public void union(int a, int b) {
int id_a = find(a);
int id_b = find(b);
if (id_a == id_b) return;
int min_id = (id_a <= id_b) ? id_a: id_b;
int max_id = (id_a > id_b) ? id_a: id_b;
id[max_id] = min_id;
count--;
}
@Override
public int count() {
return count;
}
}
} |