스누피의 개발로그 🐾

백준 - 최소 스패닝 트리Kruskal AlgorithmGreedy하게 가장 작은 cost를 가진 edge들을 선택하는 방법이다def kruskal(V, E, EDGES): # Greedy: Kruskal selects minimum edges EDGES.sort(key=lambda x: x[2]) parent = [i for i in range(V)] mst_cost = 0 def find_parent_recursive(x): if parent[x] != x: parent[x] = find_parent_recursive(parent[x]) return parent[x] def find_parent(x): while..

Dijkstra with Priority Queue# Dijkstra Algorithm with Adjacent List and Priority Heap# https://www.acmicpc.net/problem/1753from math import inffrom heapq import heappush as push, heappop as pop# 입력V, E = map(int, input().split())K = int(input()) - 1 # 시작 정점 번호EDGES = [tuple(map(int, input().split())) for _ in range(E)]# Adjacent ListADJ_EDGES = [[] for _ in range(V)]for edge in EDGES: ADJ_EDG..