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 ...