все параметры
[  bookworm  ] [  trixie  ] [  sid  ]
[ Источник: python-leidenalg  ]

Пакет: python3-leidenalg (0.10.2-2)

Ссылки для python3-leidenalg

Screenshot

Ресурсы Debian:

Исходный код python-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

  • зависимости
  • рекомендации
  • предложения
  • enhances

Загрузка python3-leidenalg

Загрузить для всех доступных архитектур
Архитектура Размер пакета В установленном виде Файлы
i386 50,0 Кб253,0 Кб [список файлов]