Basic implementation of a DisjointSet in Python

disjoint_set.py

class DisjointSet:
    def __init__(self, size):
        self.id = [i for i in range(size)]
        self.size = [1 for i in range(size)]

    def root(self, u):
        if self.id[u] == u:
            return u
        return self.root(self.id[u])

    def connected(self, u, v):
        return self.root(u) == self.root(v)

    def connect(self, u, v):
        u = self.root(u)
        v = self.root(v)
        if self.size[u] < self.size[v]:
            self.id[u] = v
            self.size[v] += self.size[u]
        else:
            self.id[v] = u
            self.size[u] += self.size[v]