Script 'mail_helper' called by obssrc
Hello community,
here is the log from the commit of package python-networkx for openSUSE:Factory
checked in at 2025-07-06 17:15:21
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/python-networkx (Old)
and /work/SRC/openSUSE:Factory/.python-networkx.new.1903 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "python-networkx"
Sun Jul 6 17:15:21 2025 rev:39 rq:1290788 version:3.5
Changes:
--------
--- /work/SRC/openSUSE:Factory/python-networkx/python-networkx.changes
2025-02-06 22:09:04.087123415 +0100
+++
/work/SRC/openSUSE:Factory/.python-networkx.new.1903/python-networkx.changes
2025-07-06 17:19:14.183070004 +0200
@@ -1,0 +2,96 @@
+Sat Jul 5 10:52:25 UTC 2025 - Dirk Müller <dmuel...@suse.com>
+
+- update to networkx-3.5:
+ * Save Layouts on Graphs (#7571).
+ * Expire d_separated and minimum_d_separator functions (#7830).
+ * Expire all_triplets deprecation (#7828).
+ * Expire random_triad deprecation (#7829).
+ * DEP: Raise an exception for k_core functions with multigraphs
+ (#7831).
+ * Deprecate graph_could_be_isomorphic (#7826).
+ * Expire total_spanning_tree_weight deprecation (#7843).
+ * Expire deprecation of create kwarg in nonisomorphic_trees
+ (#7847).
+ * New draw API (#7589).
+ * perf: optimise `random_k_out_graph` (#7702).
+ * Clausets local community detection algorithm (#7691).
+ * `find_asteroidal_triple` improvement (#7736).
+ * Add `weight` to harmonic_diameter (#7636).
+ * Densest Subgraph Problem: Greedy Peeling and Greedy++
+ Implementations (#7731).
+ * single_source_all_shortest_paths: don't loop over all nodes
+ (#7762).
+ * Error message improvement for nbunch_iter ( NetworkXError
+ raised with specific message on TypeError with "iter" in msg
+ ) (#7790).
+ * Faster computation of energy in Laplacian centrality (#7793).
+ * Make `forceatlas2_layout` dispatchable (#7794).
+ * Update dispatchable for `forceatlas2_layout` (#7798).
+ * Enable backend-only functions where NetworkX is just an API
+ (#7690).
+ * Steinertree kou enhancement in response to issue 5889
+ type:Enhancements (#7767).
+ * Add Leiden as a backend-only algorithm (#7743).
+ * Bipartite layout nodes optional (#7756).
+ * Densest Subgraph Problem: FISTA based algorithm + Large scale
+ tests (#7770).
+ * Dispatch `get_node_attributes` and a few more from
+ `nx.classes.function` (#7824).
+ * Faster `could_be_isomorphic` and `number_of_cliques` (#7855).
+ * Add square_clustering to algorithm benchmarks (#7857).
+ * Faster Implementation of Structural Holes (#7249).
+ * Improve runtime of number_of_nonisomorphic_trees() (#7917).
+ * Fix write_gexf timeformat for dynamic Graphs (#7914).
+ * Consolidate could_be_isomorphic (#7852).
+ * Improving rooted_tree_isomorphism for deep trees (#7945).
+ * Fixing nx.diameter inconsistent results with usebounds=True
+ (#7954).
+ * Faster `square_clustering` (#7810).
+ * Avoid repeated cache conversion failures for backends
+ (#7768).
+ * Improve _sparse_fruchterman_reingold with L-BFGS (#7889).
+ * Improve Performance of Tree Isomorphism and Center
+ Calculation (#7946).
+ * Add option for `biadjacency_matrix` to be returned as a dense
+ NumPy array (#7973).
+ * Add Functions for Finding Connected Dominating Sets (#7774).
+ * Add feature to make storing node contraction data optional
+ (#7902).
+ * Added "initial_node" param to generate_random_paths() to
+ allow a starting node to be specified for generated walks
+ (#8002).
+ * Fix behavior for iterable `sources` argument in `bfs_layers`
+ (#8013).
+ * Speed up `connected_components` and
+ `weakly_connected_components` (#7971).
+ * BiRank Algorithm Implementation (#7978).
+ * Enforce correct graph types for graph matchers (#8043).
+ * Fix for issue #7645: Do not preserve 'cw' and 'ccw'
+ attributes in PlanarEmbedding.to_undirected() (#7750).
+ * fix typo in ramanujan branch (#7804).
+ * Fix `with nx.config(backend_priority=backends):` (#7814).
+ * Fix handling of faux_infinite values in network_simplex
+ (#7796).
+ * Fixed the return type from an empty dict to an empty set
+ (#7910).
+ * Add `edge_attrs="weight"` to `forceatlas2_layout` dispatch
+ decorator (#7918).
+ * Fix graph_hash iteration counts and DiGraph handling (#7834).
+ * Refactored the working of chordless_cycles to handle self
+ loops (#7901).
+ * Fix bc scale with k endpoints (#7908).
+ * Fix BC scaling for source nodes with k and endpoints=False
+ (#7949).
+ * BUG: graph6 format invariant to trailing newline (#7941).
+ * Fix `random_degree_sequence_graph` when input is an iterator
+ (#7979).
+ * Improve special cases in dispatch testing (paying off tech
+ debt) (#7982).
+ * Fix bug when assigning list to `nx.config.backend_priority`
+ (#8034).
+ * A minimal fix for `is_aperiodic` (#8029).
+ * fix bug of _sparse_fruchterman_reingold and remove try/except
+ idiom (#8041).
+ * Fix edge case in ISMAGS symmetry detection (#8055).
+
+-------------------------------------------------------------------
Old:
----
networkx-3.4.2.tar.gz
New:
----
networkx-3.5.tar.gz
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Other differences:
------------------
++++++ python-networkx.spec ++++++
--- /var/tmp/diff_new_pack.zBOc8M/_old 2025-07-06 17:19:14.687090846 +0200
+++ /var/tmp/diff_new_pack.zBOc8M/_new 2025-07-06 17:19:14.687090846 +0200
@@ -18,11 +18,11 @@
%{?sle15_python_module_pythons}
Name: python-networkx
-Version: 3.4.2
+Version: 3.5
Release: 0
Summary: Python package for the study of complex networks
License: BSD-3-Clause
-URL: https://networkx.github.io/
+URL: https://github.com/networkx/networkx
Source:
https://files.pythonhosted.org/packages/source/n/networkx/networkx-%{version}.tar.gz
BuildRequires: %{python_module base >= 3.8}
BuildRequires: %{python_module pip}
++++++ networkx-3.4.2.tar.gz -> networkx-3.5.tar.gz ++++++
++++ 23577 lines of diff (skipped)
