Update dependency networkx to >=3.7,<3.8 - autoclosed - #427
Closed
renovate[bot] wants to merge 1 commit into
Closed
renovate[bot] wants to merge 1 commit into
renovate[bot] wants to merge 1 commit into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR contains the following updates:
>=3.6,<3.7→>=3.7,<3.8Release Notes
networkx/networkx (networkx)
v3.7: NetworkX 3.7Compare Source
networkx 3.7
We're happy to announce the release of networkx 3.7!
Highlights
leiden_communitiesandleiden_partitions. This provides an alternative, often improved, community detection algorithm compared to the Louvain functions (#8509).pipwith wheels that include the GraphViz binaries. This should make the NetworkX interface to pygraphviz easier to use for graph layout and rendering (#8694).API Changes
bfs_predecessors(#8494).Enhancements
is_aperiodic(#8148).nx.describedefaults (#8569)._build_paths_from_predecessorsstack logic for 30-40% speedup (#8460).barycenterandcentroidequivalence (#8630).leiden_communitiesandleiden_partitions. This provides an alternative, often improved, community detection algorithm compared to the Louvain functions (#8509).edmonds_karpand simplify theminimum_cutpartition (#8756).Bug Fixes
Documentation
edge_subgraphdocstring (#8409).dict(G.degree)in examples (#8490).random_walk(#8535).degree_histogramdocstring (#8571).basic_propertiesexample (#8568).SpanningTreeIteratorto find min spanning trees (#8556).barycenterandcentroidequivalence (#8630).leiden_partitions(#8852).bipartite.write_edgelistdocstring examples (#8872).Maintenance
could_be_isomorphicinfast_/faster_variants (#8497).write_gexffor mixed typed attributes (#8549).strategy_connected_sequential(#8643).is_forest(#8642).test_clique.py(#8214).clusteringto algorithm benchmarks (#8764).k_componentsreconstruction and add tests the private helpers (#8753).reverseto preserve all attributes in dispatch conversions (#8807).remove_{node,edge}_attributes(#8806).full_rary_tree(#8808).Other
Contributors
72 authors added to this release (alphabetically):
36 reviewers added to this release (alphabetically):
These lists are automatically generated, and may not be complete or may contain duplicates.
Configuration
📅 Schedule: (in timezone Europe/London)
🚦 Automerge: Disabled by config. Please merge this manually once you are satisfied.
♻ Rebasing: Whenever PR becomes conflicted, or you tick the rebase/retry checkbox.
🔕 Ignore: Close this PR and you won't be reminded about this update again.
This PR was generated by Mend Renovate. View the repository job log.