Comparative Analysis between Dijkstra and Bellman-Ford Algorithms in Shortest Path Optimization

Abstract

Due to the tremendous development in the field of computer and software sciences, the theory of graphics has spread widely and quickly, even becoming one of the most important sciences that played a large role in solving many problems of many diverse applications. These applications include computer protocols, Google Maps, games and more. Many researches have discussed shortest path algorithms to solve the shortest path problem in these applications. In this study, a very popular algorithms called Dijkstra algorithm and Bellman-Ford algorithm are used to make a comparison between them on the basis of complexity and performance in terms of shortest path optimization. Our results show that Dijkstra is better than the Bellman-Ford interms of execution time and more efficient for solving the shortest path issue, but the algorithm of Dijkstra work with non-negative edge weights.