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

Ariel Felner

doi:10.1609/socs.v2i1.18191

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

Ariel Felner

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

42 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 language	English
Title of host publication	Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011
Publisher	AAAI press
Pages	47-51
Number of pages	5
ISBN (Print)	9781577355373
DOIs	https://doi.org/10.1609/socs.v2i1.18191
State	Published - 2011
Externally published	Yes
Event	4th International Symposium on Combinatorial Search, SoCS 2011 - Barcelona, Spain Duration: 15 Jul 2011 → 16 Jul 2011

Publication series

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

Conference

Conference	4th International Symposium on Combinatorial Search, SoCS 2011
Country/Territory	Spain
City	Barcelona
Period	15/07/11 → 16/07/11

Access to Document

10.1609/socs.v2i1.18191

Cite this

@inproceedings{b6f2f9c36deb43bcaeeea7268700e08d,

title = "Position paper: Dijkstra's algorithm versus uniform cost search or a case against Dijkstra's algorithm",

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.",

author = "Ariel Felner",

year = "2011",

doi = "10.1609/socs.v2i1.18191",

language = "אנגלית",

isbn = "9781577355373",

series = "Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011",

publisher = "AAAI press",

pages = "47--51",

booktitle = "Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011",

note = "4th International Symposium on Combinatorial Search, SoCS 2011 ; Conference date: 15-07-2011 Through 16-07-2011",

}

Felner, A 2011, Position paper: Dijkstra's algorithm versus uniform cost search or a case against Dijkstra's algorithm. in Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011. Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011, AAAI press, pp. 47-51, 4th International Symposium on Combinatorial Search, SoCS 2011, Barcelona, Spain, 15/07/11. https://doi.org/10.1609/socs.v2i1.18191

Position paper: Dijkstra's algorithm versus uniform cost search or a case against Dijkstra's algorithm. / Felner, Ariel.
Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011. AAAI press, 2011. p. 47-51 (Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Position paper

T2 - 4th International Symposium on Combinatorial Search, SoCS 2011

AU - Felner, Ariel

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84893372124&partnerID=8YFLogxK

U2 - 10.1609/socs.v2i1.18191

DO - 10.1609/socs.v2i1.18191

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84893372124

SN - 9781577355373

T3 - Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

SP - 47

EP - 51

BT - Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

PB - AAAI press

Y2 - 15 July 2011 through 16 July 2011

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this