#path-finding #algorithm #routes #jps #map #points #struct

blitz-path

Implementations of the A* and JPS pathfinding algorithms

3 unstable releases

0.2.0 Sep 2, 2020
0.1.1 Aug 13, 2020
0.1.0 Aug 13, 2020

#2260 in Algorithms

MIT/Apache

230KB
337 lines

Contains (Zip file, 110KB) tests/map/maze512-32-9.zip

blitz-path

Rust

Source for my experiments in implementing various pathfinding algorithms in rust. 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.

Usage

Provides a Route struct representing a path between two points and functions for each algorithm to calculate the shortest Route between two points.

Testing

The .map and .scen files used for integration tests were provided by the Moving AI Lab and are distributed with permission.


lib.rs:

blitz-path

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 cargo.toml file.

[profile.release]
lto = "fat"

Dependencies

~150KB