A Low-Complexity Binary-Heap Implementation of Dijkstra's Algorithm
Year: 2014
Type: preprint
Abstract: In this paper a new implementation of Dijkstra's algorithm is presented, for the general case of arbitrary directed graphs with unbounded non-negative weights. The proposed implementation utilizes binary heaps and, for a graph consisting of n nodes and m arcs, its computational complexity is of order O(m+n log n).
Source: arXiv (Cornell University)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2246213547
