wszystkie opcje
trixie  ] [  forky  ] [  sid  ]
[ Pakiet źródłowy: libleidenalg  ]

Pakiet: liblibleidenalg1 (0.12.0-1)

Odnośniki dla liblibleidenalg1

Screenshot

Zasoby systemu Debian:

Pobieranie pakietu źródłowego libleidenalg:

Opiekunowie:

Zasoby zewnętrzne:

Podobne pakiety:

implementation of the Leiden algorithm in C++ - library

This package implements the Leiden algorithm in C++. 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 class is Optimiser 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.

This package contains the library.

Inne pakiety związane z liblibleidenalg1

  • wymaga
  • poleca
  • sugeruje
  • enhances

Pobieranie liblibleidenalg1

Pobierz dla wszystkich dostępnych architektur
Architektura Rozmiar pakietu Rozmiar po instalacji Pliki
amd64 53,3 KiB180,0 KiB [lista plików]
arm64 44,4 KiB148,0 KiB [lista plików]
armhf 42,5 KiB147,0 KiB [lista plików]
i386 54,4 KiB167,0 KiB [lista plików]
ppc64el 53,4 KiB212,0 KiB [lista plików]
riscv64 49,3 KiB123,0 KiB [lista plików]
s390x 53,0 KiB175,0 KiB [lista plików]