Network Delay Time (Djikstra's Algorithm) - Leetcode 743 - Graphs (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@user-jm6gp2qc8x]

heapq is doing a lot of heavy lifting for us here

[@saurabhbhagat4528]

Yes, and here in JavaScript I have to implement create/insert/delete everytime a heap is involved 😅

[@ericsigne6575]

@@saurabhbhagat4528 if it's in leetcode, you can just call the min priority queue class as new MinPriorityQueue(). The same logic can be used for max priority queue.

[@JSH1994]

thanks for the clear explanation!

[@__chroma__8660]

is ther eany similarity between the min heap in dijkstras, and the min heap used in prims mst algo?

[@mehraan8592]

Should we not update the cost to reach a node even if it is already in min_times because a different path may give a lesser cost/time? Please help.

[@chisomedoka5651]

Great video once again, please create one for BellmanFord

[@aakashs1806]

Can we solve this problem in prims algorithm??

[@AnkitKumar-qe9to]

Thank you @GregHogg

[@GregHogg]

You're very welcome :)

[@e889.]

Never stop uploading

[@GregHogg]

Won't

[@e889.]

@@GregHogg where to DM you??

[@ashokchourasia]

correct the title of video

[@GregHogg]

Thanks so much, fixed :)

[@otheraccount1270]

Heapq.heapify(min_heap) missing in code.

[@mehraan8592]

There is only one value initialized there and after that all values pushed are heappushed so there is no need for it. I maybe wrong. :)

[@maybae10]

@@mehraan8592 you're absolutely right! no need to heapify as the heap initially starts w a single value. then we heappush every val we add; this operation adds the curr val to end of arr and makes sure the position of the curr val maintains heap properties, moving it up or down as needed (log(N) time)