Update dependency networkx to v3 #107
Open
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:
==2.5.1->==3.6Release Notes
networkx/networkx (networkx)
v3.6: NetworkX 3.6Compare Source
networkx 3.6
We're happy to announce the release of networkx 3.6!
New Features
subgraph_centralityand its_expversion (#8340).API Changes
random_lobsterwithrandom_lobster_graph(#8067).maybe_regular_expanderwithmaybe_regular_expander_graph(#8050).Enhancements
random_treefunction (#8105).G._adjin Tarjan algorithm (#8064).edges_equal(#8077).is_reachable()(#8112).draw_networkx_edge_labelsanddisplay(#8108).all_trianglesgenerator yielding all unique triangles in a graph (#8135).k_factor(#8139).intersection_arraycomputation for checking distance-regularity (#7181).is_regularfor directed graphs (#8138).nx.circulant_graphto generate Harary graphs (#8189).directedkwarg toedges_equal(#8192).nx.Graph(backend=...)(#7760).subgraph_centralityand its_expversion (#8340).Bug Fixes
non_randomness()and clarify its behavior (#8057).nx.find_cliques_recursive(#8211).optimize_edit_pathshandling of self-loops (#8207).degree_sequence_tree(#8235).k<Nand merge all b.c. rescale helper functions (#8256).cumulative_distributionto address floating-point errors (#8342).Documentation
min_weight_matching(#8062).non_randomness()and clarify its behavior (#8057).display()keywordnode_pos(#8153).all_neighbors()(#8166).number_of_cliques(#8216).degree_sequence_tree(#8236).leidendocs (#8277).Maintenance
needs_(num|sci)py(#8088).scipy.sparsearray versions where applicable (#8080).generate_adjlist(#8146).k_factortests (#8140).pytest.raisesas a context (#8170).pyproject.toml(#8172).matrix_powerfromscipy.sparseinnumber_of_walks(#8197).try exceptfortomllibingenerate_requirements(#8198)._tree_centerand move totreesubpackage (#8174).random_cographtest (#8228).@_dispatchable(name=(#8168).slowcoverage ink_components(#8239).degree_seq(#8257).k<Nand merge all b.c. rescale helper functions (#8256).itertools.pairwiseinpairwiseand add docstring (#8201).Other
generators/deg_seq.py(#8226).max_iterinasyn_fluidc(#8224).steiner_tree(#8259).slowcoverage for random graph generators (#8252).all_node_cutswith shortest augmenting path flow function (#8230).isomorphvf2(#8251).nx_pylabdrawing tests (#8232).random_k_out_graphto tests to hittry exceptpath (#8231).internet_as_graphs.py(#8225).topo_sortskips visited nodes ingoldberg_radzik(#8279).Contributors
40 authors added to this release (alphabetically):
24 reviewers added to this release (alphabetically):
These lists are automatically generated, and may not be complete or may contain
duplicates.
v3.5: NetworkX 3.5Compare Source
networkx 3.5
We're happy to announce the release of networkx 3.5!
API Changes
Enhancements
random_k_out_graph(#7702).find_asteroidal_tripleimprovement (#7736).weightto harmonic_diameter (#7636).forceatlas2_layoutdispatchable (#7794).forceatlas2_layout(#7798).get_node_attributesand a few more fromnx.classes.function(#7824).could_be_isomorphicandnumber_of_cliques(#7855).square_clustering(#7810).biadjacency_matrixto be returned as a dense NumPy array (#7973).sourcesargument inbfs_layers(#8013).connected_componentsandweakly_connected_components(#7971).Bug Fixes
_raise_on_directedto work withcreate_usingpos arg (#7695).edge_subgraph(#7724) (#7729).ifcondition inasadpour_atsp(#7753).with nx.config(backend_priority=backends):(#7814).edge_attrs="weight"toforceatlas2_layoutdispatch decorator (#7918).random_degree_sequence_graphwhen input is an iterator (#7979).nx.config.backend_priority(#8034).is_aperiodic(#8029).Documentation
soft_random_geometric_graphandthresholded_random_geometric_graph(#7749).single_source_shortest_path_lengthdocstring (#7637).backends.pytobackends.rst(#7776).pathparameter (#7835).nx.generate_random_paths(index_map=...)(#7832).weightandgravityattribute toforceatlas2_layoutdocstring (#7915).tournament_matrixto docs (#7968).random_pathsdocstring improvements (#7841).maximum_flow()(#8058).min_edge_coverdocstring (#8075).Maintenance
partialwithstaticmethod()intest_link_prediction.py(#7673).pip installs in benchmarking workflow (#7647).osmnx=2.0.0(#7746).nx.lowest_common_ancestor(#7726).shortest_pathandsingle_target_shortest_path_lengthfor 3.5 (#7754).__call__when no backends (#7761).assertwhen usingpytest.raises(#7833).pathparameter (#7835).nx.generate_random_paths(index_map=...)(#7832).dict(...)for SSSP algos that return dicts (#7878).effective_sizeof nodes with only self-loop edges is undefined (#7347).to_dict_of_dictsandattr_matrixand input name change inmin_fill_in_heuristic(#7883).-n autofrom pytest-xdist for dispatch and coverage CI jobs (#7987).Contributors
56 authors added to this release (alphabetically):
32 reviewers added to this release (alphabetically):
*These lists are automatically generated, and
Configuration
📅 Schedule: Branch creation - At any time (no schedule defined), Automerge - At any time (no schedule defined).
🚦 Automerge: Disabled by config. Please merge this manually once you are satisfied.
♻ Rebasing: Whenever PR is behind base branch, 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.