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

Given an n-node network with lengths associated with arcs: the problem is to find the shortest paths between every pair of nodes in the network. If the network has less than n(n-1) arcs, then it is ...

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