목록서로소 집합 (1)

Scribbling

서로소 집합 알고리즘

v, e = map(int, input().split()) edges = [] for _ in range(e): edges.append(list(map(int, input().split()))) parent = [0] * (v+1) for i in range(v+1): parent[i] = i def find_parent(parent, a): if parent[a] == a: return a else: parent[a] = find_parent(parent, parent[a]) return parent[a] def union(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if a < b: parent[b] = a else: pa..
Computer Science/Algorithms & Data Structures 2021. 8. 12. 14:38
이전 Prev 1 Next 다음