[Leetcode] Network Delay Time Latency

There N is network nodes, labelled 1 to N .

Given times , a list of travel times as directed edges times[i] = (u, v, w) , where are the u source node, is the v target node, and Is the time w it takes for a signal to travel from source to target.

Now, we send a signal from a certain node K . How long would it take for all nodes to receive the signal? If It is impossible, return -1 .

Note:

1. N'll is in the range [1, 100] .
2. K'll is in the range [1, N] .
3. The length of'll is in the times range [1, 6000] .
4. All edges would have and times[i] = (u, v, w) 1 <= u, v <= N 1 <= w <= 100 .

S

[Leetcode] Network Delay Time Latency