LeetCode 743. Network Delay Time (Dijkstra's Algorithm)

    class Solution:
    def networkDelayTime(self, times: list, N: int, K: int) -> int:
        inf = int(1e9)
        g = [[int(1e9)] * N for _ in range(N)]
        for item in times:
            g[item[0] - 1][item[1] - 1] = item[2]
    
        n = len(g)
        v = [False for _ in range(n)]
        d = [inf for _ in range(n)]
        node = K - 1
        for i in range(0, n):
            g[i][i] = 0
            d[i] = g[node][i]