Shortest-Path

Dijkstra, minimax paths, and Bellman-Ford with edge limits

LeetCode 4046 note: Dijkstra with the last direction and the turns used in the state; for the same cell and direction, an earlier pop is cheaper, and if it also used fewer turns it dominates later states

LeetCode 499 note: Dijkstra prioritized by (distance, path string), and the ball stops when it rolls over the hole

LeetCode note for Network Delay Time, rebuilt from the original learning note

LeetCode note for Cheapest Flights Within K Stops, rebuilt from the original learning note

LeetCode note for Path With Minimum Effort, rebuilt from the original learning note

LeetCode 1514 note: multiplying probabilities only shrinks them, so Dijkstra applies; prune with <=