Route16
| Crates.io | Route16 |
| lib.rs | Route16 |
| version | 0.0.1 |
| created_at | 2021-08-05 04:29:41.895281+00 |
| updated_at | 2021-08-05 04:29:41.895281+00 |
| description | Fast route planning algorithm implementations |
| homepage | |
| repository | |
| max_upload_size | |
| id | 431828 |
| size | 123,047 |
Payas Rajan (PayasR)
documentation
README
Route16
This crate implements fast route planning algorithms in Rust.
Algorithms
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)