套件：python3-leidenalg（0.10.2-2）

[ 原始碼： 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 有關的套件

• dep: libc6 (>= 2.17)

  GNU C 函式庫：共用函式庫
  同時作為一個虛擬套件由這些套件填實： libc6-udeb

• dep: libgcc-s1 (>= 3.0)

  GCC 支援函式庫

• dep: libigraph3t64 (>= 0.10.0)

  library for creating and manipulating graphs

• dep: liblibleidenalg1 (>= 0.11.1)

  implementation of the Leiden algorithm in C++ - library

• dep: libstdc++6 (>= 13.1)

  GNU Standard C++ Library v3

• dep: python3

  interactive high-level object-oriented language (default python3 version)

  dep: python3 (>= 3~)

• dep: python3-igraph (>= 0.10)

  High performance graph data structures and algorithms (Python 3)

下載 python3-leidenalg

下載可用於所有硬體架構的

硬體架構	套件大小	安裝後大小	檔案
arm64	48。6 kB	267。0 kB	[檔案列表]