↓Skip to main content

Dijkstra

Heap and Priority Queue

2026-10-20·6 mins

Algorithm Heap Priority-Queue Greedy Dijkstra

heapq basics, Top-K, lazy deletion, two heaps, k-way merge, sweep line, and Dijkstra

2026-09-13·3 mins

Algorithm Graph Shortest-Path Dijkstra Bellman-Ford

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

LeetCode 499: The Maze III

2026-09-06·3 mins

LeetCode Hard Graph Dijkstra Shortest-Path Heap Matrix

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

LeetCode 743: Network Delay Time

2026-05-01·3 mins

LeetCode Medium Graph Dijkstra Shortest-Path

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

LeetCode 1631: Path With Minimum Effort

2026-04-25·3 mins

LeetCode Medium Graph Dijkstra Shortest-Path

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

LeetCode 778: Swim in Rising Water

2026-04-18·3 mins

LeetCode Hard Graph Dijkstra Binary-Search

LeetCode note for Swim in Rising Water, rebuilt from the original learning note

LeetCode 1514: Path with Maximum Probability

2026-04-17·3 mins

LeetCode Medium Graph Dijkstra Shortest-Path Heap

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