deb_control_files:
- control
- md5sums
- postinst
- prerm
deb_fields:
Architecture: amd64
Depends: python3 (>= 3~), python3-igraph (>= 0.10), python3:any, libc6 (>= 2.14),
libgcc-s1 (>= 3.0), libigraph3t64 (>= 0.10.0), liblibleidenalg1 (>= 0.11.1), libstdc++6
(>= 13.1)
Description: "Python3 implementation of the Leiden algorithm in C++\n This package\
\ implements the Leiden algorithm in C++ and exposes it to\n Python. It relies\
\ on igraph for it to function. Besides the relative\n flexibility of the implementation,\
\ it also scales well, and can be run\n on graphs of millions of nodes (as long\
\ as they can fit in memory). The\n core function is find_partition which finds\
\ the optimal partition using\n the Leiden algorithm, which is an extension of\
\ the Louvain algorithm for\n a number of different methods. The methods currently\
\ implemented are\n .\n 1. modularity,\n 2. Reichardt and Bornholdt's model\
\ using the configuration null model\n and the Erd\xF6s-R\xE9nyi null model,\n\
\ 3. the Constant Potts model (CPM),\n 4. Significance and finally\n 5. Surprise.\n\
\ .\n In addition, it supports multiplex partition optimisation allowing\n community\
\ detection on for example negative links or multiple time\n slices. There is\
\ the possibility of only partially optimising a\n partition, so that some community\
\ assignments remain fixed. It also\n provides some support for community detection\
\ on bipartite graphs."
Homepage: https://github.com/vtraag/leidenalg
Installed-Size: '264'
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
Package: python3-leidenalg
Priority: optional
Section: python
Source: python-leidenalg
Version: 0.10.2-2
srcpkg_name: python-leidenalg
srcpkg_version: 0.10.2-2