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)
- Dan Schult (@dschult)
- Erik Welch (@eriknw)
- Mridul Seth (@MridulS)
- Ross Barnowski (@rossbar)
9 reviewers added to this release (alphabetically):
- @Aka2210
- Aditi Juneja (@Schefflera-Arboricola)
- Alejandro Candioti (@amcandio)
- Colman Bouton (@LorentzFactor)
- Dan Schult (@dschult)
- Erik Welch (@eriknw)
- Gilles Peiffer (@Peiffap)
- Mridul Seth (@MridulS)
- Ross Barnowski (@rossbar)
These lists are automatically generated, and may not be complete or may contain
duplicates.