tüm seçenekler
bookworm  ] [  trixie  ] [  sid  ]
[ Kaynak: python-leidenalg  ]

Paket: python3-leidenalg (0.10.2-2)

python3-leidenalg için bağlantılar

Screenshot

Debian Kaynakları:

python-leidenalg Kaynak Paketini İndir:

Geliştiriciler:

Dış Kaynaklar:

Benzer paketler:

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 ile İlgili Diğer Paketler

  • bağımlılıklar
  • tavsiye edilen
  • önerilen
  • enhances

python3-leidenalg indir

Tüm mevcut mimariler için indir
Mimari Paket Boyutu Kurulu Boyut Dosyalar
amd64 49,9 kB264,0 kB [dosya listesi]
arm64 48,6 kB267,0 kB [dosya listesi]
armel 47,3 kB249,0 kB [dosya listesi]
armhf 47,3 kB237,0 kB [dosya listesi]
i386 50,0 kB253,0 kB [dosya listesi]
mips64el 47,7 kB271,0 kB [dosya listesi]
ppc64el 49,8 kB267,0 kB [dosya listesi]
riscv64 48,6 kB251,0 kB [dosya listesi]
s390x 48,9 kB259,0 kB [dosya listesi]