설명 코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 inf = 100 dist = [ [0,3,2,inf, inf, 8], [3,0,inf,inf, 9,1], [2,inf,0,4,inf,5], [inf,inf,4,0,3,inf], [inf,9,inf,3,0,inf], [8,1,5,inf,inf, 0] ] n = 6 #prev = [[0]* n for _ in range(n) ] def find_minidx(src,temp): tmp = inf idx = 0 for i in temp: cur = dist[src][i] if i!=src..
