Tag
dijkstra
- Oct 7, 2026 Bidirectional Search and the Problem of Knowing When to Stop Why two frontiers can meet without the answer being final, which stopping rules are provably safe, and how the meeting point is recovered from two label arrays. algorithms
- Sep 27, 2025 Dijkstra and the Settled-Set Invariant Why extracting the minimum tentative label is safe only when weights are nonnegative, how the exchange argument proves it, and what a settled set costs in memory and bookkeeping. algorithms
- Dec 3, 2024 Priority Queues for Dijkstra: Decrease-Key, Lazy Deletion, and Buckets The four practical queue designs behind the same greedy loop, what each costs per operation, and how integer weight bounds turn a comparison heap into an array of buckets. algorithms