Preprint
Oct 2026
Dijkstra Is NOT Greedy: A Global-to-Local Proof of Correctness
It is concluded that Dijkstra's algorithm is more accurately characterized by dynamic programming and deterministic path exclusion than by the traditional greedy classification.
Sheng-Bao Wang
· 0 citations