This crate implements fast route planning algorithms in Rust.
Currently implemented: * Contraction Hierarchies:
The implementation borrows heavily from the excellent RoutingKit C++ library, with one major exception; we implement the graphs using simpler adjacency lists, instead of (faster) edge lists and adjacency arrays.
Coming soon: * Edge Hierarchies (https://arxiv.org/pdf/1907.03535.pdf) * Charging Function Propagation (https://arxiv.org/abs/1910.09812)