网站管理系统制作免费seo视频教程

并查集理论基础

并查集理论基础很重要，明确并查集解决什么问题，代码如何写，对后面做并查集类题目很有帮助。

代码随想录

寻找存在的路径

并查集裸题，学会理论基础后，本题直接可以直接刷过

代码随想录

class UnionFind:def __init__(self, size):self.parent = list(range(size + 1))  # 初始化并查集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:self.parent[root_v] = root_udef is_same(self, u, v):return self.find(u) == self.find(v)def main():import sysinput = sys.stdin.readdata = input().split()index = 0n = int(data[index])index += 1m = int(data[index])index += 1uf = UnionFind(n)for _ in range(m):s = int(data[index])index += 1t = int(data[index])index += 1uf.union(s, t)source = int(data[index])index += 1destination = int(data[index])if uf.is_same(source, destination):print(1)else:print(0)if __name__ == "__main__":main()