-
Notifications
You must be signed in to change notification settings - Fork 0
/
disjoint_set.py
65 lines (51 loc) · 1.64 KB
/
disjoint_set.py
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
class DisjointSet:
def __init__(self, data):
self.data = data
self.parent = self
self.dim = 1
def union(self, other):
# combines the djs containing self and other
srep, orep = self.rep(), other.rep()
if srep is orep:
return
srep.parent = orep
orep.dim += srep.dim
def rep(self):
# returns the representative of the djs containing self
# and compresses the path from self to the rep
A = self
chain = [A]
while A.parent is not A:
A = A.parent
chain.append(A)
for C in chain:
C.parent = A
return A
def __len__(self):
return self.rep().dim
def __str__(self):
return "<" + str(self.rep().data) + ">"
def __eq__(self, other):
return self.rep() is other.rep()
if __name__=="__main__":
A, B, C = DisjointSet("A"), DisjointSet("B"), DisjointSet("C")
D, E = DisjointSet("D"), DisjointSet("E")
print(A, B, C, D, E)
print(len(A), len(B), len(C), len(D), len(E))
print(A==B, A==C, A==D, A==E)
A.union(B)
print(A, B, C, D, E)
print(len(A), len(B), len(C), len(D), len(E))
print(A==B, A==C, A==D, A==E)
B.union(C)
print(A, B, C, D, E)
print(len(A), len(B), len(C), len(D), len(E))
print(A==B, A==C, A==D, A==E)
D.union(E)
print(A, B, C, D, E)
print(len(A), len(B), len(C), len(D), len(E))
print(A==B, A==C, A==D, A==E)
C.union(D)
print(A, B, C, D, E)
print(len(A), len(B), len(C), len(D), len(E))
print(A==B, A==C, A==D, A==E)