build(deps): bump petgraph from 0.6.5 to 0.8.3 in /frontend/src-tauri

[dependabot]

Bumps petgraph from 0.6.5 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

Note
Automatic rebases have been disabled on this pull request as it has been open for over 30 days.

[dependabot]

Labels

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

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