Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
743. Network Delay Time
Bookmark
Input
Example 1 (4 nodes)
Example 2 (5 nodes)
Diamond (4 nodes)
Custom
times
=
[[2,1,1],[2,3,1],[3,4,1]]
,
n
=
4
,
k
=
2
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
∞
0
∞
∞
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
∞
2
0
3
∞
4
∞
Processed Nodes:
(none)
Min-Heap (time, node):
(empty)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
∞
0
∞
∞
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
∞
2
0
3
∞
4
∞
Processed Nodes:
(none)
Min-Heap (time, node):
(empty)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
∞
curr
0
∞
∞
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
∞
2
0
3
∞
4
∞
Processed Nodes:
(none)
Min-Heap (time, node):
(empty)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
∞
curr
0
∞
∞
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
∞
2
0
3
∞
4
∞
Processed Nodes:
2
Min-Heap (time, node):
(empty)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
1
curr
0
∞
∞
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
1
2
0
3
∞
4
∞
Processed Nodes:
2
Min-Heap (time, node):
(1, 1)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
curr
1
0
1
∞
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
1
2
0
3
1
4
∞
Processed Nodes:
2
Min-Heap (time, node):
(1, 3)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
curr
1
0
1
∞
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
1
2
0
3
1
4
∞
Processed Nodes:
2
1
Min-Heap (time, node):
(1, 3)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
1
0
curr
1
∞
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
1
2
0
3
1
4
∞
Processed Nodes:
2
1
3
Min-Heap (time, node):
(empty)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
1
0
curr
1
2
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
1
2
0
3
1
4
2
Processed Nodes:
2
1
3
Min-Heap (time, node):
(2, 4)
Network Delay Time (source: 2, n: 4)
1
1
1
1
2
3
4
1
0
1
curr
2
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
1
2
0
3
1
4
2
Processed Nodes:
2
1
3
4
Min-Heap (time, node):
(empty)
Network Delay Time (source: 2, n: 4)
Result: 2
1
1
1
1
2
3
4
1
0
1
curr
2
Legend:
Unvisited
Current
Checking
Processed
Time to reach each node:
1
1
2
0
3
1
4
2
Processed Nodes:
2
1
3
4
Min-Heap (time, node):
(empty)
algo
master
.
io
Step:
Initialize distances: source node 2 = 0, all others = ∞
0 / 17
Input
Example 1 (4 nodes)
Example 2 (5 nodes)
Diamond (4 nodes)
Custom
times
=
[[2,1,1],[2,3,1],[3,4,1]]
,
n
=
4
,
k
=
2
0 / 17
algo
master
.
io
Step:
Initialize distances: source node 2 = 0, all others = ∞
