pathfinding
Path finding library for Rust
The pathfinding crate for Rust includes the following algorithms:
- A*
- BFS
- Connected components
- DFS
- Dijkstra
- Edmonds Karp algorithm
- Fringe
- IDA*
- IDDFS
- Kuhn-Munkres
- Strongly connected components
- Topological sorting
Those algorithms are generic over their arguments.
Using pathfinding
In order to use pathfinding, you can add it to yourCargo.toml as a dependency
[dependencies]
pathfinding = "1"
and then use the crate in your application by importing it, as in
extern crate pathfinding;
use pathfinding::*;
The package documentation is available online.
Getting pathfinding
Published version (1)
You can access the crate fromDevelopment version
git clone https://github.com/samueltardieu/pathfinding.git
This will create a pathfinding directory 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 features
If 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.Submitting patches
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.