Python 3 - Disjoint Set

disjoint-set.py

class DisjointSet:
    sets = {}
    rank = {}
    
    def __init__(self, arr):
      for v in arr:
        self.sets[v] = v
        self.rank[v] = 0
        
    def merge(self, v1, v2):
        r1, r2 = self.get_root(v1), self.get_root(v2)
        
        if self.rank[r1] > self.rank[r2]:
            self.sets[r2] = r1
        elif self.rank[r2] > self.rank[r1]:
            self.sets[r1] = r2
        else:
            self.sets[r1] = r2
            self.rank[r2] += 1
        
    def get_root(self, v):
        if v == self.sets[v]:
            return v
        
        return self.get_root(self.sets[v])