python-leidenalg 0.10.2-1build2 source package in Ubuntu
Changelog
python-leidenalg (0.10.2-1build2) noble; urgency=medium * No-change rebuild for CVE-2024-3094 -- William Grant <email address hidden> Mon, 01 Apr 2024 18:19:32 +1100
Upload details
- Uploaded by:
- William Grant
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | misc | |
| Noble | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-leidenalg_0.10.2.orig.tar.gz | 439.2 KiB | 4b7b4a2acd1f9be5ee702b40ba113a4c4a59d6f76690c47db5d9b7b451d4bec0 |
| python-leidenalg_0.10.2-1build2.debian.tar.xz | 3.9 KiB | 4281dc10cc87ee69f05758fba49708803b1c8939186eacac1065d92ba11ef62c |
| python-leidenalg_0.10.2-1build2.dsc | 2.5 KiB | ab89c4f202078d91675ab30eaf8dfc206ade73dd0a15b5a783e9fbe903145465 |
Available diffs
- diff from 0.10.2-1build1 to 0.10.2-1build2 (333 bytes)
Binary packages built by this source
- python3-leidenalg: Python3 implementation of the Leiden algorithm in C++
This package implements the Leiden algorithm in C++ and exposes it to
Python. It relies on igraph for it to function. 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 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. The methods currently implemented are
.
1. modularity,
2. Reichardt and Bornholdt's model using the configuration null model
and the Erdös-Rényi null model,
3. the Constant Potts model (CPM),
4. Significance and finally
5. Surprise.
.
In addition, it supports multiplex partition optimisation allowing
community detection on for example negative links or multiple time
slices. There is the possibility of only partially optimising a
partition, so that some community assignments remain fixed. It also
provides some support for community detection on bipartite graphs.
- python3-leidenalg-dbgsym: debug symbols for python3-leidenalg
