contraction-hierarchies

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

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

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.

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

A Small Project in CS163

Convert OSM-file to graph for contraction hierarchies

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

Certified route planning under drifting costs: conformal certificates (LB<=OPT<=UB), certificate-directed sensing, proof-gated ns-us preprocessing, and an observable-coverage layer (WATCH + Shiryaev-Roberts). 250 tests, validated on real METR-LA.

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.

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.

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

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

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

Our bachelor project with shortest paths