Abstract:The execution time of Dijkstra's algorithm for shortest path routing strongly depends upon the underlying priority queue data structure used to store intermediate path costs for the graph during the algorithm's iterations. In particular, efficiency as determined by how quickly the data structure can execute the operations of EXTRACT-MIN and DECREASE-KEY. Using Dijk. stra's algorithm on graphs of various sazes and topologies, thas paper compares the actual performance of the standard implicit binary heap with t… Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.