Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
1514. Path with Maximum Probability
Bookmark
Input
3 Nodes (A)
3 Nodes (B)
5 Nodes
Custom
n
=
3
,
edges
=
[[0,1],[1,2],[0,2]]
,
succProb
=
[0.5, 0.5, 0.2]
,
startNode
=
0
,
endNode
=
2
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
1.0
0.0
0.0
Probabilities:
0
1.0
1
0.0
2
0.0
Max-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
1.0
0.0
0.0
Probabilities:
0
1.0
1
0.0
2
0.0
Max-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
1.0
0.0
0.0
Probabilities:
0
1.0
1
0.0
2
0.0
Max-Heap (Priority Queue):
(1.0, 0)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
curr
1.0
0.0
0.0
Probabilities:
0
1.0
1
0.0
2
0.0
Max-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
curr
1.0
0.0
0.0
Probabilities:
0
1.0
1
0.0
2
0.0
Max-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
curr
1.0
0.5
0.0
Probabilities:
0
1.0
1
0.5
2
0.0
Max-Heap (Priority Queue):
(0.5, 1)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
1.0
curr
0.5
0.2
Probabilities:
0
1.0
1
0.5
2
0.2
Max-Heap (Priority Queue):
(0.2, 2)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
1.0
curr
0.5
0.2
Probabilities:
0
1.0
1
0.5
2
0.2
Max-Heap (Priority Queue):
(0.2, 2)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
1.0
curr
0.5
0.2
Probabilities:
0
1.0
1
0.5
2
0.2
Max-Heap (Priority Queue):
(0.2, 2)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
1.0
0.5
curr
0.25
Probabilities:
0
1.0
1
0.5
2
0.25
Max-Heap (Priority Queue):
(0.2, 2)
Legend:
Unvisited
Current
Checking
Visited
Start
End
Path with Maximum Probability (0 → 2)
0.5
0.5
0.2
0
1
2
1.0
0.5
curr
0.25
Probabilities:
0
1.0
1
0.5
2
0.25
Max-Heap (Priority Queue):
(0.2, 2)
Legend:
Unvisited
Current
Checking
Visited
Start
End
algo
master
.
io
Step:
Initialize: build adjacency list from edges and probabilities.
0 / 19
Input
3 Nodes (A)
3 Nodes (B)
5 Nodes
Custom
n
=
3
,
edges
=
[[0,1],[1,2],[0,2]]
,
succProb
=
[0.5, 0.5, 0.2]
,
startNode
=
0
,
endNode
=
2
0 / 19
algo
master
.
io
Step:
Initialize: build adjacency list from edges and probabilities.
