Abstract
Chapter 20 introduced Dijkstra’s algorithm. Here, we take a closer look at its workings, picking up the example we’ve been using of the airline flight plan. We use the algorithm to first determine the shortest among the links directly connected to the origin, so as to find the destination closest to it. Then we determine the shortest of the remaining links, as well as those directly connected to the previously identified closest destination, thereby finding the next closest destination. This process is continued until all the destinations and links are identified. It a process that makes solving the puzzle easier and faster.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Phani Raj Tadimety
About this chapter
Cite this chapter
Tadimety, P.R. (2015). Dijkstra’s Algorithm – The Closest Look. In: OSPF: A Network Routing Protocol. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-1410-7_21
Download citation
DOI: https://doi.org/10.1007/978-1-4842-1410-7_21
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-1411-4
Online ISBN: 978-1-4842-1410-7
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)