blitz-path contains (hopefully) lightning-quick implementations of various pathfinding algorithms. Currently in a very wip state. It relies on the movingai-rust crate for map implementation and testing / benchmarks.
It currently provides implementations of the A* and JPS pathfinding algorithms.
A note on compiling: Compiling the crate with "fat" LTO can greatly improve performance. However, it also substantially slows down compilation, so it is only recommended to use this when building for release. To enable fat LTO for the
--release flag add the following to your project's
[profile.release] lto = "fat"
Describes a route between two points. Giving the total distance needed to travel and a vector of each step needed.
Creates a new route using the A* algorithm. Returns a Route struct containing the distance to the goal and number of steps needed to get there.
Creates a new route using the JPS algorithm. Returns a Route struct containing the distance to the goal and number of steps needed to get there.