Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm


Dijkstra’s single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and related fields. DA is commonly taught in undergraduate courses. Uniform-cost search (UCS) is a simple version of the best-first search scheme which is logically equivalent to DA. In this paper I compare the two algorithms and show… (More)


2 Figures and Tables