Shortest Path Algorithm using Hashing and Queue
Shruti Pant, Pooja Khulbe · International Journal of Computer Applications · 2014
Finding the shortest path in a graph means selecting the path between source and destination which gives the minimum path length.This problem of finding the shortest path can be solved using Dijkstra algorithm.The time complexity of Dijkstra algorithm is high.Looking at the shortcoming of traditional Dijkstra algorithm, this paper has proposed a new method to improve the time complexity of this algorithm using queue and hashing techniques.The time complexity of the improved algorithm is O(n log n).