【代码随想录算法训练营——Day54】并查集——107.寻找存在的路线

卡码网题目链接
https://kamacoder.com/problempage.php?pid=1179

题解
107.寻找存在的路线
照着模板代码改并查集内容，自己写输入格式，有问题：



学一下题解的写法，可以学到类的写法。

代码

#107.寻找存在的路线
num = 200
father = [0] * num
def init():for i in range(num):father[i] = idef find(u):if u == father[u]:return uelse:father[u] = find(father[u])return father[u]def isSame(u, v):u = find(u)v = find(v)return u == vdef join(u, v):u = find(u)v = find(v)if u == v:returnfather[v] = uif __name__ == "__main__":n, m = map(int, input().split())init()#graph = [[0] * (n + 1) for _ in range(n + 1)]for i in range(m):s, t = map(int, input().split())#graph[s][t] = 1join(s, t)source, destination = map(int, input().split())flag = isSame(source, destination)if flag:print(1)else:print(0)