On The Optimization of Dijkstras Algorithm
Data Structures and Algorithms
2012-12-27 v1
Abstract
In this paper, we propose some amendment on Dijkstras 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 Dijkstras algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstras algorithm is less than the number of the graphs nodes.
Keywords
Cite
@article{arxiv.1212.6055,
title = {On The Optimization of Dijkstras Algorithm},
author = {Seifedine Kadry and Ayman Abdallah and Chibli Joumaa},
journal= {arXiv preprint arXiv:1212.6055},
year = {2012}
}
Comments
Informatics in Control, Automation and Robotics, Volume 2, Springer-Verlag Berlin Heidelberg 2011