Position paper: Dijkstra's algorithm versus uniform cost search or a case against Dijkstra's algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

34 Scopus citations

Abstract

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 their similarities and differences. I claim that UCS is superior to DA in almost all aspects. It is easier to understand and implement. Its time and memory needs are also smaller. The reason that DA is taught in universities and classes around the world is probably only historical. I encourage people to stop using and teaching DA, and focus on UCS only.

Original languageEnglish
Title of host publicationProceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011
Pages47-51
Number of pages5
StatePublished - 1 Dec 2011
Event4th International Symposium on Combinatorial Search, SoCS 2011 - Barcelona, Spain
Duration: 15 Jul 201116 Jul 2011

Publication series

NameProceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

Conference

Conference4th International Symposium on Combinatorial Search, SoCS 2011
Country/TerritorySpain
CityBarcelona
Period15/07/1116/07/11

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Position paper: Dijkstra's algorithm versus uniform cost search or a case against Dijkstra's algorithm'. Together they form a unique fingerprint.

Cite this