-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdisjointSet.java
79 lines (70 loc) · 2.23 KB
/
disjointSet.java
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
import javax.print.attribute.Size2DSyntax;
import java.util.Hashtable;
import java.util.Random;
public class disjointSet {
Hashtable<Integer,Double>internalDif=new Hashtable<>();
Hashtable<Integer,Integer>PARENT=new Hashtable<>();
Hashtable<Integer,Integer>RANK=new Hashtable<>();
Hashtable<Integer,Integer>SIZE=new Hashtable<>();
public disjointSet(Integer[] universe){
for(Integer x:universe){
PARENT.put(x,x);
RANK.put(x,0);
internalDif.put(x,0.0);
SIZE.put(x,1);
}
}
public Integer find(Integer item){
if(PARENT.get(item)==item){
return item;
}
else{
PARENT.replace(item,find(PARENT.get(item)));
return find(PARENT.get(item));
}
}
public int getSize(Integer item){
return SIZE.get(find(item));
}
public void union(Integer a, Integer b,double edgeWeight){
int x=find(a);
int y=find(b);
if(x==y){
return;
}
if(RANK.get(x)>RANK.get(y)){
int childSize=SIZE.get(y);
PARENT.replace(y,x);
int curSize=SIZE.get(x);
curSize=curSize+childSize;
SIZE.replace(x,curSize);
setInternalDif(x,edgeWeight);
}else if(RANK.get(y)> RANK.get(x)){
int childSize=SIZE.get(x);
PARENT.replace(x,y);
int curSize=SIZE.get(y);
curSize=curSize+childSize;
SIZE.replace(y,curSize);
setInternalDif(y,edgeWeight);
}
else {
int childSize=SIZE.get(x);
PARENT.replace(x,y);
int curSize=SIZE.get(y);
curSize=curSize+childSize;
SIZE.replace(y,curSize);
int replace=RANK.get(y);
replace++;
RANK.replace(y,replace);
setInternalDif(y,edgeWeight);
}
}
public void setInternalDif(Integer x,double value){
Integer parent=find(x);
internalDif.replace(parent,value);
}
public double getInternalDif(Integer x){
Integer parent=find(x);
return internalDif.get(parent);
}
}