README_EN.md

743. Network Delay Time

中文文档

Description

There are N network nodes, labelled 1 to N.

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

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

 

Example 1:

Input: times = [[2,1,1],[2,3,1],[3,4,1]], N = 4, K = 2

Output: 2

 

Note:

<li><code>N</code> will be in the range <code>[1, 100]</code>.</li>

<li><code>K</code> will be in the range <code>[1, N]</code>.</li>

<li>The length of <code>times</code> will be in the range <code>[1, 6000]</code>.</li>

<li>All edges <code>times[i] = (u, v, w)</code> will have <code>1 &lt;= u, v &lt;= N</code> and <code>0 &lt;= w &lt;= 100</code>.</li>

Solutions

Python3

Java

...