An improvement of Dijkstra's method for finding a shortest path in a graph
A slight modification of Dijkstra's original method is presented. If a lower bound on the length of the shortest path between two nodes of a network is known, this modification allows to save up to 35 \% of the computing time which would be required for the original method.
scientific article; zbMATH DE number 3941582