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

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Shuijian Zhang, Xuejun Liu, Meizhen Wang, A Novel Ant Colony Optimization Algorithm For The Shortest-path Problem In Traffic Networks, Filomat, Vol. 32, No. 5 (2018), pp. 1619-1628 ...