GNU bug report logs - #77902
[PATCH science-team 0/2] Update SuiteSparse.

Previous Next

Full log

Message #35 received at 77902 <at> debbugs.gnu.org (full text, mbox):

From: Greg Hogan <code <at> greghogan.com>
To: 77902 <at> debbugs.gnu.org
Cc: Greg Hogan <code <at> greghogan.com>
Subject: [PATCH v2 science-team 7/7] gnu: python-leidenalg: Update to 0.10.2.
Date: Mon,  5 May 2025 16:43:27 +0000

* 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
---
 gnu/packages/graph.scm | 17 ++++++-----------
 1 file changed, 6 insertions(+), 11 deletions(-)

diff --git a/gnu/packages/graph.scm b/gnu/packages/graph.scm
index 49d2bd72a1..e2ef93b464 100644
--- a/gnu/packages/graph.scm
+++ b/gnu/packages/graph.scm
@@ -694,14 +694,14 @@ (define-public libleidenalg
 (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
@@ -718,19 +718,14 @@ (define-public python-leidenalg
     (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
-- 
2.49.0

Previous Next

GNU bug tracking system
Copyright (C) 1999 Darren O. Benham, 1997,2003 nCipher Corporation Ltd, 1994-97 Ian Jackson.