Binary package “python3-leidenalg” in ubuntu oracular
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.
Source package
Published versions
- python3-leidenalg 0.10.2-1build2 in amd64 (Release)
- python3-leidenalg 0.10.2-1build2 in arm64 (Release)
- python3-leidenalg 0.10.2-1build2 in armhf (Release)
- python3-leidenalg 0.10.2-1build2 in ppc64el (Release)
- python3-leidenalg 0.10.2-1build2 in riscv64 (Release)
- python3-leidenalg 0.10.2-1build2 in s390x (Release)