This crate implements several pathfinding, flow, and graph algorithms.
Algorithms for directed graphs.
Rectangular grid in which vertices can be added or removed, with or without diagonal links.
Compute a maximum weight maximum matching between two disjoints sets of vertices using the Kuhn-Munkres algorithm (also known as Hungarian algorithm).
Matrix of an arbitrary type and utilities to rotate, transpose, etc.
Export all public functions and structures for an easy access.
Algorithms for undirected graphs.
The matrix! macro allows the declaration of a Matrix from static data. All rows must have the same number of columns. The data will be copied into the matrix.