Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
