Bug Fixes

• Infinite subgraph_isomorphisms_iter for empty isomorphisms (#780)
• Algos don't work on UndirectedAdaptor (#870) (#871)
• use a queue for SPFA (#893)
• StableGraph::reverse breaks free lists (#890)

Documentation

• Fix examples link in README and unify typesetting of one word (#823)
• Add link to multigraph definition to isomorphism algos (#824)
• Fix auxiliary space (and time) complexity of bron-kerbosch (#825)
• Fix Typo in Operator Module Documentation (#831)
• Sync the crate feature flags in the README and docs (#832)
• Remove all [Generic] tags from algo docstrings (#835)
• Fix typos in comments (#836)
• Revamp CONTRIBUTING.md (#833)
• Update GraphMap link in README (#857)
• Add doc comment for Dot::with_attr_getters (#850)
• Specify iteration order for neighbors and edges and their variants (#790)
• Collection of Doc fixes (#856)

New Features

• Add into_nodes_edges_iters to StableGraph (#841)
• Add methods to reserve & shrink StableGraph capacity (#846)
• Add Dinic's Maximum Flow Algorithm (#739)
• make Csr::from_sorted_edges generic over edge type and properly increase edge_count in Csr::from_sorted_edges (#861)
• Add map_owned and filter_map_owned for Graph and StableGraph (#863)
• Add dijkstra::with_dynamic_goal (#855)
• Fix self-loop bug in all_simple_paths and enable multiple targets (#865)
• mark petgraph::dot::Dot::graph_fmt as public (#866)
• Add bidirectional Dijkstra algorithm (#782)

Performance

• Make A* tie break on lower h-values (#882)

Refactor

• add examples for scc algorithms and reorganize into dedicated module (#830)
• Remove unnecessary trait bounds from impls/methods (#828)
• replace uses of 'crate::util::zip' with 'core::iter::zip' (#849)
• Fix clippy (and other) lints (#851)
• Cleanup repo (#854)
• replace crate::util::enumerate with Iterator::enumerate (#881)

Testing

• Add dependency list for 'quickcheck' feature (#822)
• Fix feature cfg capitalization in doctest (#852)

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 for GraphMap 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

• @RaoulLuque

• @lmondada

• @MeGaGiGaGon

• @boguscoder

• @starovoid

• @Bromind

• @skius

• @pragmaticTNT

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 std HashSet (#764)

New Features

• Add UnionFind capacity management methods (#736)
• add #[track_caller] to functions that panic (#748)

Contributors

• @starovoid

• @marcospb19

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 for Float, Unit, and Bounded 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 and StableGraph (#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)