fast_paths
Pathfinder
Efficient shortest path calculation algorithm
Fast shortest path calculations for Rust
272 stars
9 watching
25 forks
Language: Rust
last commit: 10 months ago
Linked from 1 awesome list
contraction-hierarchiesdijkstra-algorithmroad-networkrouting-algorithmshortest-pathstraffic-simulation
Related projects:
Repository | Description | Stars |
---|---|---|
| Calculates shortest distances and paths on geograph-based maps using haversine formula and Dijkstra's algorithm | 7 |
| An algorithm for finding the shortest path in a graph | 32 |
| A WebAssembly-based A* pathfinding implementation for a maze demo | 427 |
| A tool that uses graph contraction hierarchies to speed up shortest path calculations on OpenStreetMap data | 17 |
| An algorithm to efficiently compute paths for multiple agents in a grid-based environment | 12 |
| Fast approximations of geodesic measurements in Rust | 9 |
| A fast and efficient file search library built in Rust | 144 |
| A fast and efficient algorithm for finding the shortest path in a grid-based environment using ActionScript 3 | 21 |
| A Rust library implementing sparse matrix data structures and linear algebra algorithms | 431 |
| Fast network analysis library using contraction hierarchies for accessibility metrics and shortest paths | 388 |
| Rust bindings and wrappers for the Basic Linear Algebra Subprograms | 84 |
| Prints a list of paths as a tree-like structure | 463 |
| A proof-of-concept demonstrating how to call Rust code from Haskell | 131 |
| A fast linear algebra library for games and graphics | 1,555 |
| A Rust library implementing a keyword extraction algorithm to automatically identify relevant words in text | 33 |