Crate pathfinding[−][src]
This crate implements several pathfinding, flow, and graph algorithms.
Re-exports
pub extern crate num_traits; |
Modules
directed |
Algorithms for directed graphs. |
grid |
Rectangular grid in which vertices can be added or removed, with or without diagonal links. |
kuhn_munkres |
Compute a maximum weight maximum matching between two disjoints sets of vertices using the Kuhn-Munkres algorithm (also known as Hungarian algorithm). |
matrix |
Matrix of an arbitrary type and utilities to rotate, transpose, etc. |
prelude |
Export all public functions and structures for an easy access. |
undirected |
Algorithms for undirected graphs. |
utils |
Miscellaneous utilities |