Leetcode 743. Network Delay Time
Given a directed, nonnegative-weighted graph and a start node k, compute single-source shortest-path distances and return the maximum distance (the time for the signal to reach all nodes) or -1 if any node is unreachable; weights are nonnegative so Dijkstra is applicable.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.