Releases: evenfurther/pathfinding
Releases · evenfurther/pathfinding
v4.2.1
- Document that A*/Dijkstra/Fringe/idA* costs must be non-negative
- Upgrade dependencies
- Use new clippy lint name
- Add bench for separate_components
- Bench Kuhn-Munkres algorithm
- Remove itertools dependency
- Remove unnecessary .into_iter() in tests
v4.2.0
- Add Grid::from_coordinates()
- Add the possibility to dispay the grid with reversed line order
- Add more Grid documentation
v4.1.1
- Better performances in Grid, Kruskal and Edmonds-Karp
v4.1.0
- Add Matrix::items() and Matrix::items_mut()
- Rename Matrix::indices() as Matrix::keys() and deprecate Matrix::indices()
- Clarify the ordering of coordinate tuples in Matrix
- Add more Grid documentation
- Enable clippy pedantic mode by default
v4.0.1
- Improve bfs performance
- Add documentation for possible errors and panics
v4.0.0
- Add move_in_direction and in_direction to utils
- Make some function const
- Cleanups
- Count paths
- Add minimum_cut capability to EdmondsKarp
- Bump MSRV to 1.65.0
- Update dependencies
v3.0.14
- Use into_keys() where appropriate
- Add fake regex dev dependency
- Use boolean::then_some()
- Update criterion requirement from 0.3.4 to 0.4.0
- Optimize Yen's algorithm
- Routes are already sorted by cost and path len
v3.0.13
- Document possibility of looping endlessly in kuhn_munkres related functions
- Use matches!() to simplify expression
v3.0.12
- Add two algorithms (Floyd and Brent) to detect cycles
- Deprecate absdiff() in favor of Rust 1.60 abs_diff()
- Remove double must-use
v3.0.11
- Introduce
Grid::{bfs,dfs}_reachable()
anddeprecate Grid::reachable()
- Remove
Copy
bound on predicate ofMatrix::{bfs,dfs}_reachable()
- Use anonymous lifetimes when appropriate
- Add example for
kuhn_munkres()