An implementation of Dykstra's shortest paths algorithm is proposed, which requires O(m log D) computations in worst case, where m denotes the number of arcs and D the length of the longest arc of the graphs considered. To this effect, a data structure called binary counting tree is introduced. © 1980.
Hansen, P. (1980). An O(tm log D) Algorithm for shortest paths. Discrete Applied Mathematics, 2(2), 151–153. https://doi.org/10.1016/0166-218X(80)90004-9