Comparison of Dijkstra's Algorithm with other proposed algorithms

Abstract

In 1959, Dijkstra proposed an algorithm to determine the shortest path between two nodes in a graph. The algorithm gets lots of attention as it can solve many real life problems. The algorithm is a greedy type algorithm. Other types of algorithms are also developed and compared. Application based improvements are done on the original algorithm. Time complexity of the algorithm is improved at the cost of space complexity. Implementation of such algorithm is possible as modern hardware allows more space complexity