Abstract
I’ll start the chapter with the description of Dijkstra’s algorithm from the Math Wiki site; it’s a very elegant description and one that is worth reading:
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
See Math Wiki, http://math.wikia.com/wiki/Dijkstra’s_algorithm
Author 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 First Look. In: OSPF: A Network Routing Protocol. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-1410-7_20
Download citation
DOI: https://doi.org/10.1007/978-1-4842-1410-7_20
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)