diff options
| author | Greg Hogan <code@greghogan.com> | 2025-05-05 15:52:35 +0000 |
|---|---|---|
| committer | Greg Hogan <code@greghogan.com> | 2025-05-13 16:35:43 +0000 |
| commit | c0fc7d2a0a8ac1b39f8fe9a9cbc43bda405d008e (patch) | |
| tree | cfae23a9bbe1a1d66a234b9881080860811702b6 | |
| parent | 35a15c5a700c0acc0dab9f07f847f51b5a0e1873 (diff) | |
gnu: python-leidenalg: Update to 0.10.2.
* gnu/packages/graph.scm (python-leidenalg): Update to 0.10.2.
[inputs]: Add libleidenalg.
[description]: Update to account for removal of C++ implementation.
Change-Id: Ia00e819eda4c03f25e54dc72483c7bcaf2ab396f
| -rw-r--r-- | gnu/packages/graph.scm | 17 |
1 files changed, 6 insertions, 11 deletions
diff --git a/gnu/packages/graph.scm b/gnu/packages/graph.scm index c0f0e450e2..61ad5da575 100644 --- a/gnu/packages/graph.scm +++ b/gnu/packages/graph.scm @@ -715,14 +715,14 @@ of millions of nodes (as long as they can fit in memory).") (define-public python-leidenalg (package (name "python-leidenalg") - (version "0.9.1") + (version "0.10.2") (source (origin (method url-fetch) (uri (pypi-uri "leidenalg" version)) (sha256 (base32 - "1wvmi6ca9kf8pbxg6b18n64h82wr9a6wcdazyn82pww0dwxzwp3y")))) + "0k1f35bmgff8vc5fcyqa2dqfa1x17rb0vqzwkdqlm0sr5fllfh8g")))) (build-system python-build-system) (arguments '(#:tests? #f ;tests are not included @@ -739,19 +739,14 @@ of millions of nodes (as long as they can fit in memory).") (native-inputs (list pkg-config python-setuptools-scm)) (inputs - (list igraph)) + (list igraph libleidenalg)) (propagated-inputs (list python-igraph)) (home-page "https://github.com/vtraag/leidenalg") (synopsis "Community detection in large networks") - (description - "Leiden is a general algorithm for methods of community detection in -large networks. This package implements the Leiden algorithm in C++ and -exposes it to Python. Besides the relative flexibility of the implementation, -it also scales well, and can be run on graphs of millions of nodes (as long as -they can fit in memory). The core function is @code{find_partition} which -finds the optimal partition using the Leiden algorithm, which is an extension -of the Louvain algorithm, for a number of different methods.") + (description "Leiden is a general algorithm for methods of community +detection in large networks and is an extension of the Louvain algorithm. This +packages provides a Python wrapper to the C++ implementation.") (license license:gpl3+))) (define-public edge-addition-planarity-suite |