Python으로 구현한 12978번 배달 문제 풀이입니다. https://programmers.co.kr/learn/courses/30/lessons/12978 코딩테스트 연습 - 배달 5 [[1,2,1],[2,3,3],[5,2,2],[1,4,2],[5,3,1],[5,4,2]] 3 4 6 [[1,2,1],[1,3,2],[2,3,2],[3,4,3],[3,5,2],[3,5,3],[5,6,1]] 4 4 programmers.co.kr from collections import defaultdict, deque def solution(n, road, k) : graph = defaultdict(list) for v1, v2, dis in road : graph[v1].append((v2, dis)) graph[..
