[BOJ] 그래프 - 1197 최소 스패닝 트리

www.acmicpc.net/problem/1197

1197번: 최소 스패닝 트리

 

import sys
import heapq

INF = int(1e10)

n, m = map(int, sys.stdin.readline().rstrip().split())
edges = []
parent = [i for i in range(n + 1)]

for _ in range(m):
    a, b, cost = map(int, sys.stdin.readline().rstrip().split())
    edges.append((cost, a, b))

edges.sort()


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


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

print(result)