Breaking News: Grepper is joining You.com. Read the official announcement!

from collections import defaultdict import heapq class Solution: def networkDelayTime(self, times: List[List[int]], N: int, K: int) -> int: graph = defaultdict(list) for i,j,w in times: graph[i].append((j,w)) heap =

Palakurthy Badrieshwar answered on July 12, 2023 Popularity 1/10 Helpfulness 1/10

answer from collections import defaultdict import heapq class Solution: def networkDelayTime(self, times: List[List[int]], N: int, K: int) -> int: graph = defaultdict(list) for i,j,w in times: graph[i].append((j,w)) heap =

from collections import defaultdict import heapq class Solution: def networkDelayTime(self, times: List[List[int]], N: int, K: int) -> int: graph = defaultdict(list) for i,j,w in times: graph[i].append((j,w)) heap =

Comment

from collections import defaultdict
import heapq
class Solution:
    def networkDelayTime(self, times: List[List[int]], N: int, K: int) -> int:
        graph = defaultdict(list)
        for i,j,w in times:
            graph[i].append((j,w))
        heap = [(0,K)]
        array = [0] + [float("inf")] * N
        while heap:
            time,ele = heapq.heappop(heap)
            if time < array[ele]:
                array[ele] = time
                for j,w in graph[ele]:
                    heapq.heappush(heap,(time+w,j))
        if max(array) < float("inf"):
            return max(array)
        else:
            return -1

Popularity 1/10 Helpfulness 1/10 Language cpp

Source: leetcode.com

Tags: c++ class collections defaultdict graph heap heapq import

Link to this answer
Share Copy Link

Contributed on Jul 12 2023

Palakurthy Badrieshwar

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

from collections import defaultdict import heapq class Solution: def networkDelayTime(self, times: List[List[int]], N: int, K: int) -> int: graph = defaultdict(list) for i,j,w in times: graph[i].append((j,w)) heap =

Contents

More Related Answers

from collections import defaultdict import heapq class Solution: def networkDelayTime(self, times: List[List[int]], N: int, K: int) -> int: graph = defaultdict(list) for i,j,w in times: graph[i].append((j,w)) heap =

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.