[Algorithm] 프림: 최소 신장 트리(MST)

import heapq

def prim(n, graph):
    visited = set()
    pq = [(0, 0)]
    mst_cost = 0

    while pq:
        weight, node = heapq.heappop(pq)

        if node in visited:
            continue
        visited.add(node)
        mst_cost += weight

        for neighbor, w in graph[node]:
            if neighbor not in visited:
                heapq.heappush(pq, (w, neighbor))

    return mst_cost

graph = {0: [(1, 1), (2, 4)], 1: [(0, 1), (2, 2)], 2: [(0, 4), (1, 2)]}
print(prim(3, graph))