chore(deps): Bump petgraph from 0.6.5 to 0.8.2

[dependabot]

Bumps petgraph from 0.6.5 to 0.8.2.

Release notes

Sourced from petgraph's releases.

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

... (truncated)

Changelog

Sourced from petgraph's changelog.

0.8.2 - 2025-06-06

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)

0.8.1 - 2025-04-07

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)

... (truncated)

Commits

• 2f8b190 chore: release v0.8.2 (#768)
• eeb98c4 docs: Unify algo docs (#815)
• dd2541c docs: Fix link and mention Dfs and Bfs as special case in examples (#816)
• 5fdd192 perf: Reuse queue allocation in maximum_matching main loop (#817)
• d4272c1 docs: Clarification of references to nodes and V (refresh #358) (#814)
• 90a220b docs: Add note about StableGraph::edge_indices behaviour (#812)
• f5f791c docs: Update docs.rs (#807)
• 04b6950 docs: Minimal typo fix in comments (#803)
• 77ed02b docs: Add examples to minimum spanning tree functions (#808)
• 1125c33 fix: Quickcheck random01 function only outputs 0 (#798)
• Additional commits viewable in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot merge will merge this PR after your CI passes on it
• @dependabot squash and merge will squash and merge this PR after your CI passes on it
• @dependabot cancel merge will cancel a previously requested merge and block automerging
• @dependabot reopen will reopen this PR if it is closed
• @dependabot close will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually
• @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)

[dependabot]

Reviewers

The following users could not be added as reviewers: palladium-maintainers. Either the username does not exist or it does not have the correct permissions to be added as a reviewer.

Labels

The following labels could not be found: dependencies, rust. Please create them before Dependabot can add them to a pull request.

Please fix the above issues or remove invalid values from dependabot.yml.

[dependabot]

The reviewers field in the dependabot.yml file will be removed soon. Please use the code owners file to specify reviewers for Dependabot PRs. For more information, see this blog post.

[dependabot]

Superseded by #32.