Dijkstra’s Algorithm-A Case Study to Understand How Algorithms are improved

In Graph Theory, Dijkstra’s Algorithm is one of the most well-known algorithms to calculate the Shortest Path. Many researchers have used its basic algorithm and attempted to improve its time complexity. This research is targeting the most famous works of such researchers. Few commonly known simple data structures like an array, link list, priority queues, and few advanced level data structures like binomial, Fibonacci are revisited and surveyed. The main target of this research/study is the evolutionary improvements in the time complexity of these algorithms. These improvements make it a suitable candidate to see how algorithms can run efficiently and the contributions of different researchers