Skip to content

Conversation

@dependabot
Copy link
Contributor

@dependabot dependabot bot commented on behalf of github Oct 6, 2025

Bumps the openapi-dependencies group in /openapi with 1 update: petgraph.

Updates petgraph from 0.8.2 to 0.8.3

Release notes

Sourced from petgraph's releases.

petgraph-v0.8.3

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

... (truncated)

Changelog

Sourced from petgraph's changelog.

0.8.3 - 2025-09-30

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

... (truncated)

Commits
  • 1629035 chore: release v0.8.3 (#826)
  • ce23445 ci: Use new cargo resolver when running CI with MSRV (#887)
  • ef5d17d docs: Collection of Doc fixes (#856)
  • b682695 fix: StableGraph::reverse breaks free lists (#890)
  • 29f4c92 fix: use a queue for SPFA (#893)
  • b87dbc5 perf: Make A* tie break on lower h-values (#882)
  • 49d2740 refactor: replace crate::util::enumerate with Iterator::enumerate (#881)
  • 0a0efbe docs: Specify iteration order for neighbors and edges and their variants (#790)
  • 5c7e0fb ci: Fix Hashbrown dependencies (#878)
  • aa53dbe feat: Add bidirectional Dijkstra algorithm (#782)
  • Additional commits viewable in compare view

Dependabot compatibility score

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 <dependency name> major version will close this group update PR and stop Dependabot creating any more for the specific dependency's major version (unless you unignore this specific dependency's major version or upgrade to it yourself)
  • @dependabot ignore <dependency name> minor version will close this group update PR and stop Dependabot creating any more for the specific dependency's minor version (unless you unignore this specific dependency's minor version or upgrade to it yourself)
  • @dependabot ignore <dependency name> will close this group update PR and stop Dependabot creating any more for the specific dependency (unless you unignore this specific dependency or upgrade to it yourself)
  • @dependabot unignore <dependency name> will remove all of the ignore conditions of the specified dependency
  • @dependabot unignore <dependency name> <ignore condition> will remove the ignore condition of the specified dependency and ignore conditions

Bumps the openapi-dependencies group in /openapi with 1 update: [petgraph](https://github.com/petgraph/petgraph).


Updates `petgraph` from 0.8.2 to 0.8.3
- [Release notes](https://github.com/petgraph/petgraph/releases)
- [Changelog](https://github.com/petgraph/petgraph/blob/master/CHANGELOG.md)
- [Commits](https://github.com/petgraph/petgraph/compare/[email protected]@v0.8.3)

---
updated-dependencies:
- dependency-name: petgraph
  dependency-version: 0.8.3
  dependency-type: direct:production
  update-type: version-update:semver-patch
  dependency-group: openapi-dependencies
...

Signed-off-by: dependabot[bot] <[email protected]>
@dependabot dependabot bot added dependencies Pull requests that update a dependency file rust Pull requests that update rust code labels Oct 6, 2025
@arlyon arlyon merged commit 9beed28 into master Oct 6, 2025
14 checks passed
@dependabot dependabot bot deleted the dependabot/cargo/openapi/openapi-dependencies-da8e93c50f branch October 6, 2025 12:43
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

dependencies Pull requests that update a dependency file rust Pull requests that update rust code

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants