Releases: petgraph/petgraph
Releases · petgraph/petgraph
petgraph-v0.8.2
This minor release fixes several bugs, adds two new algorithms, slightly improves the performance of maximum_matching
,
adds a tool for parsing graphs from Dot/Graphviz files, and improves the documentation, making it more complete and uniform, as well as clarifying several points.
Bug Fixes
- Ford Fulkerson sometimes Panics on StableGraphs (#793)
- Run Maximal Cliques Quickcheck only on Digraphs which are symmetrical (#800)
- Run Steiner Tree Quickcheck on the connected components to properly support disconnected graphs (#801)
- Quickcheck random01 function only outputs 0 (#798)
Documentation
- Specify that Acyclic::try_udpate_edge may add an edge (#770)
- Update remove_node doc comment in graphmap.rs (#663)
- Add examples to minimum spanning tree functions (#808)
- Minimal typo fix in comments (#803)
- Update docs.rs (#807)
- Add note about
StableGraph::edge_indices
behaviour (#812) - Clarification of references to nodes and V (refresh #358) (#814)
- Fix link and mention Dfs and Bfs as special case in examples (#816)
- Unify algo docs (#815)
New Features
- (parser) allow parsing graphs from Dot/Graphviz files (#653)
- Implement
DataMap
forGraphMap
graphs (#776) - Add Johnson's algorithm (#741)
- Add algorithm to find bridge edges (#590)
Performance
- Reuse queue allocation in
maximum_matching
main loop (#817)
Refactor
- Fix new clippy warnings (#791)
Contributors
petgraph-v0.8.1
This patch release re-adds a missing VisitMap
implementation that was dropped in the 0.8.0
release,
improves error messaging in panicking functions, and adds capacity management methods to UnionFind
.
Bug Fixes
- Bring back
VisitMap
impl for stdHashSet
(#764)
New Features
Contributors
petgraph-v0.8.0
Breaking changes
- Add
no_std
Support (#747) - Add
VisitMap::unvisit
as proposed in #610 (#611) - Add support for specifying rankdir on dot plots. (#728)
- Make
dot::Config
non_exhaustive (#756) - Add
from_f32/64
methods forFloat
,Unit
, andBounded
measures (#733)
New algorithms
- Add articulation points implementation (#681)
- Add Prim's Algorithm for Minimum Spanning Tree (#625)
- Add Kou's algorithm for finding a MST (#682)
- Add Bron-Kerbosch algorithm for maximal cliques (#662)
- Add Shortest Path Faster Algorithm Implementation (#686)
New features
- Add
UnionFind::new_set
(#684) - Implement
Csr::try_add_edge
(#719) - Add checked
UnionFind
methods (#730) - Add
MatrixGraph
methods with recoverable errors (#720) - Add methods with recoverable errors for
Graph
andStableGraph
(#718)
CI & fixes
- Fix all clippy lints and check them on CI (#726)
- Pin once_cell version for MSRV builds (#750)
- Require conventional commits tag in PR titles (#734)
- Fix wrong trigger for pr-title check (#751)
- Solve clippy warnings (#749)
- Fix github token in pr-title action (#752)
- Add new triggers for semver-checks (#754)
Documentation
- Add some missed features into crate-lvl doc (#758)