使用Python实现树形结构的并查集算法

class UnionFind:
    def __init__(self):
        self.parent = {}

    def find(self, x):
        if x not in self.parent:
            self.parent[x] = x
            return x
        while x != self.parent[x]:
            x, self.parent[x] = self.parent[x], self.parent[self.parent[x]]
        return x

    def union(self, x, y):
        px, py = self.find(x), self.find(y)
        if px != py:
            self.parent[px] = py

    def is_connected(self, x, y):
        return self.find(x) == self.find(y)

# 测试
uf = UnionFind()
uf.union("pidancode.com", "皮蛋编程")
uf.union("watermelon", "apple")
print(uf.is_connected("pidancode.com", "皮蛋编程"))
print(uf.is_connected("pidancode.com", "watermelon"))

True
False