It combines techniques from Bellman-Ford, a slower algorithm and Dijkstra’s to improve runtime. It minimizies reliance on priority queue sorting by processing multiple nodes (the “frontier”) at once ...

About AURA - Advanced Unified Routing Algorithms: A modern ES package providing graph shortest-path algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall) with benchmarks and tests.