Similar questions can be solved by Dijkstra method:
- Network Delay Time
- Minimum Obstacle Removal to Reach Corner
- Cheapest Flights Within K Stops
- Path with Maximum Probability
- Number of Ways to Arrive at Destination
- Second Minimum Time to Reach Destination
- Find the City With the Smallest Number of Neighbors at a Threshold Distance
- Swim in Rising Water
- Path With Minimum Effort