GoalScope — disjoint_set (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
class DisjointSet:↵
"""Disjoint Set with Path Compression and Union by Rank"""↵
def __init__(self, n):↵
self.parent = list(range(n))↵
self.rank = [0] * n↵
↵
def find(self, u):↵
if self.parent[u] != u:↵
self.parent[u] = self.find(self.parent[u])↵
return self.parent[u]↵
↵
def union(self, u, v):↵
root_u = self.find(u)↵
root_v = self.find(v)↵
if root_u != root_v:↵
if self.rank[root_u] > self.rank[root_v]:↵
self.parent[root_v] = root_u↵
elif self.rank[root_u] < self.rank[root_v]:↵
self.parent[root_u] = root_v↵
else:↵
self.parent[root_v] = root_u↵
self.rank[root_u] += 1↵
</code>