dependabot[bot] opened a new pull request, #16337:
URL: https://github.com/apache/datafusion/pull/16337

   Bumps [petgraph](https://github.com/petgraph/petgraph) from 0.8.1 to 0.8.2.
   <details>
   <summary>Release notes</summary>
   <p><em>Sourced from <a 
href="https://github.com/petgraph/petgraph/releases";>petgraph's 
releases</a>.</em></p>
   <blockquote>
   <h2>petgraph-v0.8.2</h2>
   <p>This minor release fixes several bugs, adds two new algorithms, slightly 
improves the performance of <code>maximum_matching</code>,
   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.</p>
   <h3>Bug Fixes</h3>
   <ul>
   <li>Ford Fulkerson sometimes Panics on StableGraphs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/793";>#793</a>)</li>
   <li>Run Maximal Cliques Quickcheck only on Digraphs which are symmetrical 
(<a href="https://redirect.github.com/petgraph/petgraph/pull/800";>#800</a>)</li>
   <li>Run Steiner Tree Quickcheck on the connected components to properly 
support disconnected graphs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/801";>#801</a>)</li>
   <li>Quickcheck random01 function only outputs 0 (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/798";>#798</a>)</li>
   </ul>
   <h3>Documentation</h3>
   <ul>
   <li>Specify that Acyclic::try_udpate_edge may add an edge (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/770";>#770</a>)</li>
   <li>Update remove_node doc comment in graphmap.rs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/663";>#663</a>)</li>
   <li>Add examples to minimum spanning tree functions (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/808";>#808</a>)</li>
   <li>Minimal typo fix in comments (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/803";>#803</a>)</li>
   <li>Update docs.rs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/807";>#807</a>)</li>
   <li>Add note about <code>StableGraph::edge_indices</code> behaviour (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/812";>#812</a>)</li>
   <li>Clarification of references to nodes and V (refresh <a 
href="https://redirect.github.com/petgraph/petgraph/issues/358";>#358</a>) (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/814";>#814</a>)</li>
   <li>Fix link and mention Dfs and Bfs as special case in examples (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/816";>#816</a>)</li>
   <li>Unify algo docs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/815";>#815</a>)</li>
   </ul>
   <h3>New Features</h3>
   <ul>
   <li><em>(parser)</em> allow parsing graphs from Dot/Graphviz files (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/653";>#653</a>)</li>
   <li>Implement <code>DataMap</code> for <code>GraphMap</code> graphs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/776";>#776</a>)</li>
   <li>Add Johnson's algorithm (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/741";>#741</a>)</li>
   <li>Add algorithm to find bridge edges (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/590";>#590</a>)</li>
   </ul>
   <h3>Performance</h3>
   <ul>
   <li>Reuse queue allocation in <code>maximum_matching</code> main loop (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/817";>#817</a>)</li>
   </ul>
   <h3>Refactor</h3>
   <ul>
   <li>Fix new clippy warnings (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/791";>#791</a>)</li>
   </ul>
   <h3>Contributors</h3>
   <ul>
   <li>
   <p><a href="https://github.com/RaoulLuque";><code>@​RaoulLuque</code></a></p>
   </li>
   <li>
   <p><a href="https://github.com/lmondada";><code>@​lmondada</code></a></p>
   </li>
   <li>
   <p><a 
href="https://github.com/MeGaGiGaGon";><code>@​MeGaGiGaGon</code></a></p>
   </li>
   <li>
   <p><a href="https://github.com/boguscoder";><code>@​boguscoder</code></a></p>
   </li>
   <li>
   <p><a href="https://github.com/starovoid";><code>@​starovoid</code></a></p>
   </li>
   </ul>
   <!-- raw HTML omitted -->
   </blockquote>
   <p>... (truncated)</p>
   </details>
   <details>
   <summary>Changelog</summary>
   <p><em>Sourced from <a 
href="https://github.com/petgraph/petgraph/blob/master/CHANGELOG.md";>petgraph's 
changelog</a>.</em></p>
   <blockquote>
   <h2><a 
href="https://github.com/petgraph/petgraph/compare/petgraph@v0.8.1...petgraph@v0.8.2";>0.8.2</a>
 - 2025-06-06</h2>
   <p>This minor release fixes several bugs, adds two new algorithms, slightly 
improves the performance of <code>maximum_matching</code>,
   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.</p>
   <h3>Bug Fixes</h3>
   <ul>
   <li>Ford Fulkerson sometimes Panics on StableGraphs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/793";>#793</a>)</li>
   <li>Run Maximal Cliques Quickcheck only on Digraphs which are symmetrical 
(<a href="https://redirect.github.com/petgraph/petgraph/pull/800";>#800</a>)</li>
   <li>Run Steiner Tree Quickcheck on the connected components to properly 
support disconnected graphs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/801";>#801</a>)</li>
   <li>Quickcheck random01 function only outputs 0 (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/798";>#798</a>)</li>
   </ul>
   <h3>Documentation</h3>
   <ul>
   <li>Specify that Acyclic::try_udpate_edge may add an edge (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/770";>#770</a>)</li>
   <li>Update remove_node doc comment in graphmap.rs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/663";>#663</a>)</li>
   <li>Add examples to minimum spanning tree functions (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/808";>#808</a>)</li>
   <li>Minimal typo fix in comments (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/803";>#803</a>)</li>
   <li>Update docs.rs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/807";>#807</a>)</li>
   <li>Add note about <code>StableGraph::edge_indices</code> behaviour (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/812";>#812</a>)</li>
   <li>Clarification of references to nodes and V (refresh <a 
href="https://redirect.github.com/petgraph/petgraph/issues/358";>#358</a>) (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/814";>#814</a>)</li>
   <li>Fix link and mention Dfs and Bfs as special case in examples (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/816";>#816</a>)</li>
   <li>Unify algo docs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/815";>#815</a>)</li>
   </ul>
   <h3>New Features</h3>
   <ul>
   <li><em>(parser)</em> allow parsing graphs from Dot/Graphviz files (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/653";>#653</a>)</li>
   <li>Implement <code>DataMap</code> for <code>GraphMap</code> graphs (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/776";>#776</a>)</li>
   <li>Add Johnson's algorithm (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/741";>#741</a>)</li>
   <li>Add algorithm to find bridge edges (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/590";>#590</a>)</li>
   </ul>
   <h3>Performance</h3>
   <ul>
   <li>Reuse queue allocation in <code>maximum_matching</code> main loop (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/817";>#817</a>)</li>
   </ul>
   <h3>Refactor</h3>
   <ul>
   <li>Fix new clippy warnings (<a 
href="https://redirect.github.com/petgraph/petgraph/pull/791";>#791</a>)</li>
   </ul>
   </blockquote>
   </details>
   <details>
   <summary>Commits</summary>
   <ul>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/2f8b190caa24b741cc30e98b5b0c4ae40b4b2133";><code>2f8b190</code></a>
 chore: release v0.8.2 (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/768";>#768</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/eeb98c43393a6fd0c178004717ceb153c3a10443";><code>eeb98c4</code></a>
 docs: Unify algo docs (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/815";>#815</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/dd2541c9edbcfec62212e676c483cbee985469c4";><code>dd2541c</code></a>
 docs: Fix link and mention Dfs and Bfs as special case in examples (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/816";>#816</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/5fdd192ba8d9a36d40a1398543dbe50754f459bf";><code>5fdd192</code></a>
 perf: Reuse queue allocation in <code>maximum_matching</code> main loop (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/817";>#817</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/d4272c1116378b2cd0fd5ae9c52ccbd76b741573";><code>d4272c1</code></a>
 docs: Clarification of references to nodes and V (refresh <a 
href="https://redirect.github.com/petgraph/petgraph/issues/358";>#358</a>) (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/814";>#814</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/90a220b2cdb54f5829a87e60ff14322acf7c6f51";><code>90a220b</code></a>
 docs: Add note about <code>StableGraph::edge_indices</code> behaviour (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/812";>#812</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/f5f791c72ab40bf0331561f5e7218693ca38af4e";><code>f5f791c</code></a>
 docs: Update docs.rs (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/807";>#807</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/04b6950fb270bc0ee63310ff0138a26e6397e51c";><code>04b6950</code></a>
 docs: Minimal typo fix in comments (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/803";>#803</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/77ed02bfe992eb1c1f4a9f53e49651c1c1586e7f";><code>77ed02b</code></a>
 docs: Add examples to minimum spanning tree functions (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/808";>#808</a>)</li>
   <li><a 
href="https://github.com/petgraph/petgraph/commit/1125c33fea0ec3f85d25fc658f1cbe7de7631cd2";><code>1125c33</code></a>
 fix: Quickcheck random01 function only outputs 0 (<a 
href="https://redirect.github.com/petgraph/petgraph/issues/798";>#798</a>)</li>
   <li>Additional commits viewable in <a 
href="https://github.com/petgraph/petgraph/compare/petgraph@v0.8.1...petgraph@v0.8.2";>compare
 view</a></li>
   </ul>
   </details>
   <br />
   
   
   [![Dependabot compatibility 
score](https://dependabot-badges.githubapp.com/badges/compatibility_score?dependency-name=petgraph&package-manager=cargo&previous-version=0.8.1&new-version=0.8.2)](https://docs.github.com/en/github/managing-security-vulnerabilities/about-dependabot-security-updates#about-compatibility-scores)
   
   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-automerge-start)
   [//]: # (dependabot-automerge-end)
   
   ---
   
   <details>
   <summary>Dependabot commands and options</summary>
   <br />
   
   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)
   
   
   </details>


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: github-unsubscr...@datafusion.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: github-unsubscr...@datafusion.apache.org
For additional commands, e-mail: github-h...@datafusion.apache.org

Reply via email to