network-delay-time

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a network of <code>n</code> nodes, labeled from <code>1</code> to <code>n</code>. You are also given <code>times</code>, a list of travel times as directed edges <code>times[i] = (ui, vi, wi)</code>, where <code>ui</code> is the source node, <code>vi</code> is the target node, and <code>wi</code> is the time it takes for a signal to travel from source to target.

We will send a signal from a given node <code>k</code>. Return the minimum time it takes for all the <code>n</code> nodes to receive the signal. If it is impossible for all the <code>n</code> nodes to receive the signal, return <code>-1</code>.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2019/05/23/931_example_1.png" style="width: 217px; height: 239px;" />
<pre>
Input: times = [[2,1,1],[2,3,1],[3,4,1]], n = 4, k = 2
Output: 2
</pre>

Example 2:

<pre>
Input: times = [[1,2,1]], n = 2, k = 1
Output: 1
</pre>

Example 3:

<pre>
Input: times = [[1,2,1]], n = 2, k = 2
Output: -1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= k &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= times.length &lt;= 6000</code></li>
	<li><code>times[i].length == 3</code></li>
	<li><code>1 &lt;= ui, vi &lt;= n</code></li>
	<li><code>ui != vi</code></li>
	<li><code>0 &lt;= wi &lt;= 100</code></li>
	<li>All the pairs <code>(ui, vi)</code> are unique. (i.e., no multiple edges.)</li>
</ul>

networkDelayTime

Network Delay Time

The Time When the Network Becomes Idle

the-time-when-the-network-becomes-idle

网络空闲的时刻

Second Minimum Time to Reach Destination

second-minimum-time-to-reach-destination

到达目的地的第二短时间

Depth-First Search

Breadth-First Search

Graph

Shortest Path

Heap (Priority Queue)

有 <code>n</code> 个网络节点，标记为&nbsp;<code>1</code>&nbsp;到 <code>n</code>。

给你一个列表&nbsp;<code>times</code>，表示信号经过 有向 边的传递时间。&nbsp;<code>times[i] = (ui, vi, wi)</code>，其中&nbsp;<code>ui</code>&nbsp;是源节点，<code>vi</code>&nbsp;是目标节点， <code>wi</code>&nbsp;是一个信号从源节点传递到目标节点的时间。

现在，从某个节点&nbsp;<code>K</code>&nbsp;发出一个信号。需要多久才能使所有节点都收到信号？如果不能使所有节点收到信号，返回&nbsp;<code>-1</code> 。

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode.com/uploads/2019/05/23/931_example_1.png" style="height: 220px; width: 200px;" />

<pre>
输入：times = [[2,1,1],[2,3,1],[3,4,1]], n = 4, k = 2
输出：2
</pre>

示例 2：

<pre>
输入：times = [[1,2,1]], n = 2, k = 1
输出：1
</pre>

示例 3：

<pre>
输入：times = [[1,2,1]], n = 2, k = 2
输出：-1
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= k &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= times.length &lt;= 6000</code></li>
	<li><code>times[i].length == 3</code></li>
	<li><code>1 &lt;= ui, vi &lt;= n</code></li>
	<li><code>ui != vi</code></li>
	<li><code>0 &lt;= wi &lt;= 100</code></li>
	<li>所有 <code>(ui, vi)</code> 对都 互不相同（即，不含重复边）</li>
</ul>