Fast shortest path calculations for Rust

Algorithms for Routing and Solving the Traffic Assignment Problem

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.

contraction hierarchies

Shortest Path Algorithms on an Ocean Routing Graph extracted from Open Street Map data.

Offline routing, multi-vehicle VRP & street geocoding for one downloaded area — Rust engine, driven from Python or a CLI

A Small Project in CS163

Convert OSM-file to graph for contraction hierarchies

Pure-Rust Customizable Contraction Hierarchies (CCH): build, customize, and serve fast shortest-path, distance-matrix, and route queries on road networks — bit-identical to RoutingKit, no C++/FFI.

ICS'25: Parallel Contraction Hierarchies Can Be Efficient and Scalable

Serious calibration and benchmarking for the `state_collapser` HRL package

High-performance shortest path engine for Karachi's road network using Hub Labeling with Contraction Hierarchies, built in Rust. Fetches live OSM data, preprocesses once, and answers point-to-point queries in microseconds.

Pathfinding on real road networks with CH, CCH, and Dijkstra. As well as a 3D interactive map.

Flight advisor API for finding the cheapest flights between two cities using Contraction hierarchies.

Certified route planning under drifting costs: conformal certificates (LB<=OPT<=UB), certificate-directed sensing, proof-gated ns-us preprocessing. 223 tests, 16 reproduction pipelines, theory incl. an impossibility theorem.

Our bachelor project with shortest paths

Package using state_collapser to give logarithmic speed-up to search for k-simplices in a graph.

Package implementing recursive pseudo-dimensional reductions of RL state spaces for the synthetic creation of hierarchical reinforcement learning (HRL) training curricula.

Route Mapping for Long-Distance Cycle Touring: A Java app for calcluating and viewing cycling routes across the UK.