Leetcode Problem 743. Network Delay Time

743. Network Delay Time

Leetcode Solutions

Create an adjacency list from the times array, where each entry adj[source] contains a list of pairs (time, dest) representing the travel time and destination node for each edge.
Initialize an array signalReceivedAt with a large value for all nodes to represent infinity.
Set signalReceivedAt[k] to 0 since the signal starts from node k.
Add (0, k) to the priority queue, where 0 is the current shortest distance to k.
While the priority queue is not empty: a. Pop the node currNode with the smallest distance currDist from the queue. b. If currDist is greater than signalReceivedAt[currNode], skip to the next iteration. c. For each (time, neighborNode) in adj[currNode], if currDist + time is less than signalReceivedAt[neighborNode], update signalReceivedAt[neighborNode] and add (currDist + time, neighborNode) to the queue.
After processing all nodes, find the maximum value in signalReceivedAt. If it's still the initial large value for any node, return -1. Otherwise, return the maximum value.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen