A new algorithm for the shortest‐path problem
Amr Elmasry, Ahmed Shokry · Networks · 2018
Abstract In this article we propose a new single‐source shortest‐path algorithm that achieves the same O(n · m) time bound as the Bellman‐Ford‐Moore algorithm but outperforms it and other state‐of‐the‐art algorithms in many cases in practice. Our claims are supported by experimental evidence.