Method find

python/2709-greatest-common-divisor-traversal.py:7–10

(self, x)

        self.count = n

    def find(self, x):
        if self.par[x] != x:
            self.par[x] = self.find(self.par[x])
        return self.par[x]

    def union(self, x, y):
        px, py = self.find(x), self.find(y)