Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

ABSTRACT: With the deepening of global economic integration, maritime logistics has become the core pillar of international trade, carrying more than 80% of global trade volume. Among the factors ...

Researchers have successfully used a quantum algorithm to solve a complex century-old mathematical problem long considered impossible for even the most powerful conventional supercomputers. The ...

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

1 Department of Industrial Engineering and Maintenance, Polytechnic University of Mongo, Mongo, Chad. 2 Department of Technical Sciences, University of N’Djamena, N’Djamena, Chad. 3 Department of ...

In the Dijkstra algorithm, when a shorter path to a neighbor is found, the neighbor's priority in the priority queue should be updated regardless of whether it is already present in the queue. In this ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Mr. Ferguson is a documentary filmmaker. As you scroll through the internet, you’ve probably noticed the same problem Kirby Ferguson has: “Everything looks the same, sounds the same, is the same.” In ...

Abstract: To address the limitations of the traditional Dijkstra algorithm in two-dimensional path optimization problems, this article uses ant colony algorithm to optimize the Dijkstra algorithm, ...