Skip to main content
Book Chapter

Dijkstra's algorithm

  • Gass S
  • Harris C
Springer US, (2001), 214-214
DOI: 10.1007/1-4020-0611-x_248
N/ACitations
Citations of this article
167Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A definition of the term "Dijkstra's algorithm" is presented. The term refers to a method for finding shortest paths in a network. The algorithmic steps for finding the shortest paths from s to all other nodes in the network are discussed. The definition presented has been applied to operations research and management science.

Cite

CITATION STYLE

APA

Gass, S. I., & Harris, C. M. (2001). Dijkstra’s algorithm. In Encyclopedia of Operations Research and Management Science (pp. 214–214). Springer US. https://doi.org/10.1007/1-4020-0611-x_248

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free