There is a new sorting algorithm a deterministic O (m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

The algorithm around this seems to be incorporated in car navigation systems of cars. In this way, PathFinding.js can experience various route search algorithms.

For Dijkstra’s algorithm, since the entire shortest-path tree is generated, every node is a goal, and there can be no specific-goal-directed heuristic. A* Search Without Expansions: Learning Heuristic ...

The Ant Colony Optimization (ACO) algorithm is a metaheuristic nature-inspired technique for solving various combinatorial optimization problems. The shortest-path problem is an important ...

Johannes O. Royset, W. Matthew Carlyle, R. Kevin Wood, Routing Military Aircraft With A Constrained Shortest-Path Algorithm, Military Operations Research, Vol. 14, No ...

I'm sitting here, and doing some homework, flow networks. And a question lead me to think, how to determine if a shortest-path is unique (I want to know is a min-cut is unique).This is standard ...