Path finding library for Rust
pathfinding crate for Rust includes the following algorithms:
- Connected components
- Edmonds Karp algorithm
- Strongly connected components
- Topological sorting
Those algorithms are generic over their arguments.
Using pathfindingIn order to use pathfinding, you can add it to your
Cargo.tomlas a dependency
and then use the crate in your application by importing it, as in
[dependencies] pathfinding = "2.0"
The package documentation is available online.
extern crate pathfinding; use pathfinding::*;
Published version (2.0)You can access the crate from and the .
Development versionYou can get the current development version of pathfinding using git:
This will create a
git clone https://github.com/samueltardieu/pathfinding.git
pathfindingdirectory in which you will be able to record your own changes. You can also browse the pathfinding repository on GitHub.
Contributing to pathfinding
Reporting bugs and asking for featuresIf you find a bug or have an idea for a new feature, you might consider adding a new issue. The more precise you will be in your description, the more useful it will be.
Patches are gladly accepted from their original author. Along with any patches, please state that the patch is your original work and that you license the work to the pathfinding project under a license compatible with the current one (Apache 2.0 license / MIT license).
To propose a patch, you may fork the pathfinding repository on GitHub, and issue a pull request. You may also send patches and pull requests by email.