IFermi
IFermi copied to clipboard
Bump networkx from 3.2.1 to 3.3
Bumps networkx from 3.2.1 to 3.3.
Release notes
Sourced from networkx's releases.
NetworkX 3.3
networkx 3.3
We're happy to announce the release of networkx 3.3!
API Changes
- Disallow negative number of nodes in
complete_multipartite_graph(#7057).- DEP: Deprecate the all_triplets one-liner (#7060).
- [A-star] Added expansion pruning via cutoff if cutoff is provided (#7073).
- Make HITS raise exceptions consistent with power iterations (#7084).
- DEP: Deprecate random_triad (#7061).
- Added feature modular graph product (#7227).
- ENH: Speed up common/non_neighbors by using _adj dict operations (#7244).
- Deprecate the
createargument ofnonisomorphic_trees(#7316).- Improve total_spanning_tree_weight (#7100).
- Update init.py (#7320).
- add **kwargs to traveling_salesman_problem (#7371).
Enhancements
- Add Tadpole graph (#6999).
- [A-star] Added expansion pruning via cutoff if cutoff is provided (#7073).
- Implementation of $S^1$ model (#6858).
- [Feat] Random expanders utilities (#6761).
- Compare graphs for generator functions when running tests with backend (#7066).
- Add Kirchhoff index / Effective graph resistance (#6926).
- Changed return types of shortest path methods to improve consistency (#6584).
- New PR for Fixes minimal d-separator function failing to handle cases where no d-separators exist (#7019).
- ENH : Provide non-normalized and normalized directed laplacian matrix calculation (#7199).
- feat: drop the use of node attribute "first_nbr" in PlanarEmbedding (#7202).
- Add functions to compute Schultz and Gutman Index (#3709).
- Divisive community algorithms (#5830).
- Added feature modular graph product (#7227).
- ENH : added
sort_neighborsto all functions indepth_first_search.py(#7196).- New graph generator for the Kneser graph (#7146).
- Draw MultiDiGraph edges and labels qa7008 (#7010).
- Use github actions to run a comparison benchmark (#7268).
- BFS layout implementation (#5179).
- Add
max_level=argument tolouvain_communitiesto limit macro-iterations (#6909).- Review and update
@nx._dispatchableusage since 3.2.1 (#7302).- Transmogrify
_dispatchableobjects into functions (#7298).- fix: make
PlanarEmbedding.copy()useadd_edges_from()from parent (closes #7223) (#7224).- Allow seed of np.random instance to exactly produce arbitrarily large integers (#6869).
- Improve total_spanning_tree_weight (#7100).
- add seed to
nx.generate_random_paths(#7332).- Allow backends to implement
should_run(#7257).- Adding tree broadcasting algorithm in a new module (#6928).
- Option to include initial labels in
weisfeiler_lehman_subgraph_hashes(#6601).- Add better error message when trying to get edge that is not present (#7245).
... (truncated)
Commits
7fdddfaDesignate 3.3 release7fe09ddBump the GH actions with 3 updates (#7310)83d2cf4Move the backend docs and connect the config docs. Both in a single sidebar e...754173bFix exception fordel config[key](#7391)26d218bRm deprecated np.row_stack in favor of vstack. (#7390)0d878d8Update test suite to handle when scipy is not installed (#7388)fbb2d82Add dispatching to broadcasting.py (#7386)76c3e9bFix pygraphviz tests causing segmentation faults in backend test (#7380)c8c838fadd **kwargs to traveling_salesman_problem (#7371)6e84e1eENH: Cache graphs objects when converting to a backend (#7345)- 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 rebasewill rebase this PR@dependabot recreatewill recreate this PR, overwriting any edits that have been made to it@dependabot mergewill merge this PR after your CI passes on it@dependabot squash and mergewill squash and merge this PR after your CI passes on it@dependabot cancel mergewill cancel a previously requested merge and block automerging@dependabot reopenwill reopen this PR if it is closed@dependabot closewill close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually@dependabot show <dependency name> ignore conditionswill show all of the ignore conditions of the specified dependency@dependabot ignore this major versionwill 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 versionwill 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 dependencywill close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)