Abstract: Dijkstra’s shortest path algorithm is a fundamental graph search method widely used in domains such as navigation, robotics, gaming, and network routing. However, its performance can degrade ...

A header-only C++ implementation of the single-source shortest path (SSSP) algorithm for sparse directed graphs with non-negative weights, based on the 2025 paper by Duan et al. This algorithm is ...

Abstract: Graph theory is a powerful tool for addressing problems involving discrete structures, such as determining the shortest length of connected river networks or the shortest distance between ...