parent = [i for i in range(n)]
# 경로가 필요한 경우
def find_parent(parent, x):
if parent[x] != x:
return find_parent(parent, parent[x])
return x
# 경로가 필요하지 않은 경우 (경로 압축 방법)
def find_parent(parent, x):
if parent[x] != x:
parent[x] = find_parent(parent, parent[x])
return parent[x]
def union_parent(parent, a, b):
a = find_parent(parent, a)
b = find_parent(parent, b)
if a < b:
parent[b] = a
else:
parent[a] = b
edges = [(cost, a, b) for _ in range(e) a, b, cost = map(int, iniput().split())]
edges.sort()
def kruskal(parent, edges):
result = 0
for edge in edges:
cost, a, b = edge
if find_parent(parent, a) != find_parent(parent, b):
union_parent(parent, a, b)
result += cost
return result
from collections import deque
def topologySort(graph, indegree):
result = []
q = deque()
for i in range(n):
if indegree[i] == 0:
q.append(i)
while q:
node = q.popleft()
result.append(node)
for i in graph[node]:
indegree[i] -= 1
if indegree[i] == 0:
q.append(i)
return result
풀이특징
n, m = map(int, input().split())
parent = [i for i in range(n+1)]
def find_parent(x):
if parent[x] != x:
parent[x] = find_parent(parent[x])
return parent[x]
def union_parent(a, b):
a = find_parent(a)
b = find_parent(b)
if a < b:
parent[b] = a
else:
parent[a] = b
for _ in range(m):
unionCheck, a, b = map(int, input().split())
if unionCheck == 1:
a = find_parent(a)
b = find_parent(b)
print("YES" if a == b else "NO")
else:
union_parent(a, b)
풀이특징
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
parent = [i for i in range(n)]
edges = []
for _ in range(m):
a, b, cost = map(int, input().split())
edges.append((cost, a-1, b-1))
edges.sort()
def find_parent(x):
if parent[x] != x:
parent[x] = find_parent(parent[x])
return parent[x]
def union_parent(a, b):
a = find_parent(a)
b = find_parent(b)
if a < b:
parent[b] = a
else:
parent[a] = b
result = 0
maxCost = 0
for edge in edges:
cost, a, b = edge
a = find_parent(a)
b = find_parent(b)
if a != b:
union_parent(a, b)
result += cost
maxCost = cost
print(result - maxCost)