Dijkstra Is NOT Greedy: A Global-to-Local Proof of Correctness
Dijkstra's algorithm is almost universally classified as a canonical greedy algorithm. This paper challenges that conventional interpretation and presents a simple, direct proof of correctness from a different viewpoint. Contrary to the widespread intuition that the algorithm repeatedly makes a local choice and thereby...