Network Delay Time
You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a signal to travel from source to target. We send a signal from a given node k. Return the minimum time it takes for all the n nodes to receive the signal. If it is impossible for all the n nodes to receive the signal, return -1.

30:00

Network Delay Time
medium
Topics
Companies

You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a signal to travel from source to target. We send a signal from a given node k. Return the minimum time it takes for all the n nodes to receive the signal. If it is impossible for all the n nodes to receive the signal, return -1.

Example 1:
Input: {"times":[[2,1,1],[2,3,1],[3,4,1]],"n":4,"k":2}
Output: 2
Constraints:

  • 1≤k≤n≤1001 \leq k \leq n \leq 100

  • 1≤times.length≤60001 \leq \text{times.length} \leq 6000

  • times[i].length==3\text{times}[i].\text{length} == 3

  • 1≤ui,vi≤n1 \leq u_i, v_i \leq n

  • ui≠viu_i \neq v_i

  • 0≤wi≤1000 \leq w_i \leq 100

  • All pairs (ui,vi)(u_i, v_i) are unique.

Input
arr ={"times":[[2,1,1],[2,3,1],[3,4,1]],"n":4,"k":2}

Start Dijkstra Max Time: 0

111

1

2

3

4

Variables
No variables to display
DepthFunction Call
Stack empty
0/12