GitHub

A Rust implementation of the O(m log^(2/3) n) Single-Source Shortest Paths algorithm for directed graphs with non-negative edge weights, as described in the paper:

"Breaking the Sorting Barrier for Directed Single-Source Shortest Paths" by Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, and Longhui Yin (2025) Use the road_network_benchmark example to evaluate the ...
Scientific Research Publishing

Dijkstra, E.W. (1959) A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1, 269-271.

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

New Sorting Algorithm Breakthrough is Better than Dijkstra

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

Technical Perspective: Shortening the Path to Designing Efficient Graph Algorithms

Graph theory is an integral component of algorithm design that underlies sparse matrices, relational databases, and networks. Improving the performance of graph algorithms has direct implications to ...
IEEE

A Hybrid Multi-Agent System Approach for Distributed Composite Convex Optimization Under Unbalanced Directed Graphs

Abstract: This paper studies a distributed composite convex optimization problem for multi-agent systems over an unbalanced directed graph. The global objective function is the sum of local cost ...
Wired

Scientists Establish the Best Algorithm for Traversing a Map

The original version of this story appeared in Quanta Magazine. If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a ...