Abstract
In this paper, we propose some amendment on Dijkstra's algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstra's algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstra's algorithm is less than the number of the graph's nodes. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
APA
Kadry, S., Abdallah, A., & Joumaa, C. (2011). On the optimization of Dijkstra’s algorithm. In Lecture Notes in Electrical Engineering (Vol. 133 LNEE, pp. 393–397). https://doi.org/10.1007/978-3-642-25992-0_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free