2021 International Conference on Computing, Communication, and Intelligent Systems (ICCCIS) · 2021 · 32 citations · 2 references
ComputingComputer ScienceAlgorithmsData StructuresParallel AlgorithmsAlgorithm AnalysisGraph AlgorithmsGraph AnalyticsGraph TheoryLinked ListsShortest Path AlgorithmsDijkstra's AlgorithmIndexing Data StructuresLinked List AlgorithmsShortest Path ProblemsTest Cases
Dijkstra algorithm is not improved in terms of space and time-complexity, the algorithm is muddled to apply in network analysis for enormous test cases. To handle this huge time complexity, advanced structures are applied to enhance Dijkstra algorithm. The use of a keen and numerical procedure speeds up the enhanced Dijkstra by multiple times. In this paper four approaches using advanced data structures like linked list, Fibonacci heap, binary heap and bi-directional Dijkstra are applied and their performance is also analyzed and compared on two classes of graphs, dense and sparse graphs.
2
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations