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

A New Algorithm Beats Dijkstra's Time For The Shortest Path To Any Point In A Network

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...
GitHub

Harper does not seem to utilise a dictionary aware of enough technical terminology

Having used Harper for a few days, I've repeatedly come across terminology and jargon which Harper doesn't know. Note: everything is lowercase, including acronyms, which leads to quite a few more ...
IEEE

Optimization of Traffic System Based on Ant Colony Algorithm and Dijkstra's Algorithm

Abstract: This study focuses on the urban transportation system by using the ant colony algorithm and Dijkstra's algorithm, aiming to comprehensively analyze the transportation system by combining ...
Scientific Research Publishing

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

ABSTRACT: This paper contributes to the theoretical literature by analyzing the relationship between changes in sparsity and their impacts on financial networks with incomplete and random ...
IEEE

A shortest path algorithm of long-period cyclic fully connected layer graph based on Dijkstra algorithm

Abstract: For the shortest path problem of cyclic directed fully connected layer graph in several cycles, there is no excellent general solution algorithm in the literature. In this paper, we address ...