sssp

A ~mvp~ Rust implementation of the DunMao et al breakthrough? deterministic algorithm for Single-Source Shortest Paths (SSSP) that breaks the O(m + n log n) sorting barrier on directed graphs. Based on the 2025 paper by Duan, Mao and collaborators from Tsinghua University.

Client-side routing library for OpenMapTiles vector tiles. Computes optimal routes for pedestrian, car, and bicycle travel entirely client-side — no routing backend or third-party service required.

ssspx is a clean, typed, and tested implementation of a deterministic Single‑Source Shortest Paths solver for directed graphs with non‑negative weights. It follows a BMSSP‑style divide‑and‑conquer design (levels, FindPivots, bounded base case) and includes a switchable frontier, an optional constant‑outdegree transform.

Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)

OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.

A python implementation of a graph algorithm for solving the single source shortest path problem called Delta Stepping Algorithm

JS implementation of Single-Source Shortest Path Algorithm based on Duan Et al. research

Graph Processing Framework that supports || OpenMP || CAPI

Speculate and Correct Algorithm - An optimized Bellman-Ford-like algorithm

Solution in Common Lisp to the SSSP problem through Dijkstra's algoritm. This library also provide an efficient implementation of both a direct, weighted graph and a priority queue (MIN-HEAP).

Parallel Delta-Stepping SSSP algorithm with the bucket fusion technique invented by Zhang et al. (CGO 2020). Implemented in C++, using the openMP parallelization API.

Golang SSSP library

Implementation of the first algorithm to break the O(m + nlogn) time bound of Dijkstra's algorithm on sparse graphs

Solution in Prolog to the SSSP problem through Dijkstra's algoritm. This library also provide an efficient implementation of both a direct, weighted graph and a priority queue (MIN-HEAP).

Conducted a comparative analysis on scaling results for graph algorithms like single source shortest path (SSSP) algorithm using multiple runtime systems thereby reducing time to solution for graph processing with message driven runtime systems (like Charm++, HPX5), parallel boost graph library, or Graph500

A parallel variant of a graph algorithm (dijkstra’s algorithm) using OpenMP on a Cray machine (XE6/XK7) and performed the benchmarking for single node up to 32 processing units

🚀 Breakthrough SSSP algorithm: 3.7x faster than Dijkstra! Eliminates O(V log V) sorting barrier with bucket-based processing. 4 algorithms, comprehensive testing, research documentation. Perfect for algorithm research and competitive programming.

A collection of sorting algorithms and data structures implemented in C++. Each algorithm and data structure comes with its own set of test cases to ensure correctness and robustness.

Interactive pathfinding visualizer using real OpenStreetMap (Bhopal) road networks. Features real-time visualization of A* (Haversine), Dijkstra, and Near-Linear SSSP algorithms across driving/walking modes. Powered by React, Vite, Leaflet Canvas rendering, and Turf.js.

GPU-accelerated road network graph analytics pipeline — SSSP, 5-metric centrality analysis, and nx-cugraph backend methods, inspired by NVIDIA DLI. / NVIDIA DLI 학습 기반 GPU 가속 도로망 그래프 분석 파이프라인 — SSSP · 중심성 5종 · nx-cugraph 백엔드 3방식 구현.