NetworkX 3.6rc0
networkx 3.6rc0
We're happy to announce the release of networkx 3.6rc0!
Unclaimed project
Are you a maintainer of networkx? Claim this project to take control of your public changelog and roadmap.
Changelog
Network Analysis in Python
Last updated 7 days ago
AutoGPT is the vision of accessible AI for everyone, to use and to build on. Our mission is to provide the tools, so that you can focus on what matters.
Stable Diffusion web UI
🤗 Transformers: the model-definition framework for state-of-the-art machine learning models in text, vision, audio, and multimodal models, for both inference and training.
A feature-rich command-line audio/video downloader
We're happy to announce the release of networkx 3.6rc0!
random_tree function (#8105).G._adj in Tarjan algorithm (#8064).edges_equal (#8077).is_reachable() (#8112).draw_networkx_edge_labels and display (#8108).all_triangles generator yielding all unique triangles in a graph (#8135).k_factor (#8139).intersection_array computation for checking distance-regularity (#7181).is_regular for directed graphs (#8138).nx.circulant_graph to generate Harary graphs (#8189).directed kwarg to edges_equal (#8192).nx.Graph(backend=...) (#7760).non_randomness() and clarify its behavior (#8057).nx.find_cliques_recursive (#8211).optimize_edit_paths handling of self-loops (#8207).degree_sequence_tree (#8235).k<N and merge all b.c. rescale helper functions (#8256).min_weight_matching (#8062).non_randomness() and clarify its behavior (#8057).display() keyword node_pos (#8153).all_neighbors() (#8166).number_of_cliques (#8216).degree_sequence_tree (#8236).leiden docs (#8277).needs_(num|sci)py (#8088).scipy.sparse array versions where applicable (#8080).generate_adjlist (#8146).k_factor tests (#8140).pytest.raises as a context (#8170).pyproject.toml (#8172).matrix_power from scipy.sparse in number_of_walks (#8197).try except for tomllib in generate_requirements (#8198)._tree_center and move to tree subpackage (#8174).random_cograph test (#8228).@_dispatchable(name= (#8168).slow coverage in k_components (#8239).degree_seq (#8257).k<N and merge all b.c. rescale helper functions (#8256).itertools.pairwise in pairwise and add docstring (#8201).generators/deg_seq.py (#8226).max_iter in asyn_fluidc (#8224).steiner_tree (#8259).slow coverage for random graph generators (#8252).all_node_cuts with shortest augmenting path flow function (#8230).isomorphvf2 (#8251).nx_pylab drawing tests (#8232).random_k_out_graph to tests to hit try except path (#8231).internet_as_graphs.py (#8225).topo_sort skips visited nodes in goldberg_radzik (#8279).38 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.