Bump networkx from 3.4.2 to 3.6.1

[dependabot]

Bumps networkx from 3.4.2 to 3.6.1.

Release notes

Sourced from networkx's releases.

NetworkX 3.6.1

networkx 3.6.1

We're happy to announce the release of networkx 3.6.1!

API Changes

• Add spectral bipartition community finding and greedy bipartition using node swaps (#8347).

Enhancements

• Nodelists for from_biadjacency_matrix (#7993).
• Add spectral bipartition community finding and greedy bipartition using node swaps (#8347).
• Fix draw_networkx_nodes with list node_shape and add regression test (#8363).

Bug Fixes

• Fix: allow graph subclasses to have additional arguments (#8369).

Documentation

• DOC: Improve benchmarking readme (#8358).
• DOC: More details re: RC releases in the release process devdocs (#8346).
• DOC: clarify difference between G.nodes/G.nodes() and G.edges/G.edges() in tutorial (#8300).
• DOC: Add blurb to contributor guide about drawing tests (#8370).
• DOC: Fix underline lens in docstrings (#8371).
• Rolling back shortest paths links (#8373).

Maintenance

• MAINT: Replace string literal with comment (#8359).
• Bump actions/checkout from 5 to 6 in the actions group (#8360).
• pin python 3.14 to be version 3.14.0 until dataclasses are fixed (#8365).
• Blocklist Python 3.14.1 (#8372).

Other

• TST: add tests for unsupported graph types in MST algorithms (#8353).
• TST: clean up isomorphism tests (#8364).

Contributors

10 authors added to this release (alphabetically):

• @​Aka2210
• @​jfinkels
• @​NaorTIRAM
• Aditi Juneja (@​Schefflera-Arboricola)
• Alejandro Candioti (@​amcandio)
• Colman Bouton (@​LorentzFactor)

... (truncated)

Commits

• 7530809 Designate 3.6.1 release
• 4788eb0 Rolling back shortest paths links (#8373)
• 696edb6 Fix draw_networkx_nodes with list node_shape and add regression test (#8363)
• c38830c Blocklist Python 3.14.1 (#8372)
• 81d2311 DOC: Fix underline lens in docstrings. (#8371)
• a6e2bfa DOC: Add blurb to contributor guide about drawing tests. (#8370)
• 96b6282 DOC: clarify difference between G.nodes/G.nodes() and G.edges/G.edges() in tu...
• 75bdd73 Fix: allow graph subclasses to have additional arguments (#8369)
• 7663fa5 TST: clean up isomorphism tests (#8364)
• 3dacd1b Add spectral bipartition community finding and greedy bipartition using node ...
• 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 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)

[CLAassistant]

Thank you for your submission! We really appreciate it. Like many open source projects, we ask that you sign our Contributor License Agreement before we can accept your contribution.
_{You have signed the CLA already but the status is still pending? Let us recheck it.}