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: Finding the shortest path is a classic problem, which is of great significance in robot pathfinding, automatic logistics distribution, map navigation, and other fields. When studying this ...
Abstract: Edge Path Bundling (EBP) is widely used in graph visualization, but it faces challenges such as high computational complexity, loss of directional information in directed graphs, and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results