Paket: python3-leidenalg (0.10.2-2) [debports]

[ Källkod:  ]

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.

Andra paket besläktade med python3-leidenalg

• dep: libc6 (>= 2.4)

  GNU C-bibliotek: Delade bibliotek
  också ett virtuellt paket som tillhandahålls av libc6-udeb

• dep: libgcc-s1 (>= 3.0)

  GCC stödbibliotek

• 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 standardbibliotek v3 för C++

• 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)

Hämta python3-leidenalg

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
ppc64 (inofficiell anpassning)	49,8 kbyte	331,0 kbyte	[filförteckning]