Ubuntu
libleidenalg package

libleidenalg 0.11.1-2build1 source package in Ubuntu

Changelog

libleidenalg (0.11.1-2build1) noble; urgency=high

  * No change rebuild against libigraph3t64.

 -- Julian Andres Klode <email address hidden>  Fri, 22 Mar 2024 17:37:28 +0100

Upload details

Uploaded by:
Julian Andres Klode
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
misc
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libleidenalg_0.11.1.orig.tar.xz 42.0 KiB b251e29f62feddb8fdadbdbe8b5e495dec5ea124d502cdab3b01395337701d78
libleidenalg_0.11.1-2build1.debian.tar.xz 5.4 KiB c025a1c0c19d0d7268acaf9a54a324f06e38655e4fa8fd533560699ea26b5868
libleidenalg_0.11.1-2build1.dsc 2.1 KiB 8f27aa27566b2321d64e8efb1233992bb715f0bf8a55ccedd5b95d3868f68fc4

View changes file

Binary packages built by this source

liblibleidenalg-dev: implementation of the Leiden algorithm in C++ - headers

 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 C++ development files. Most people will find it
 easier to work with the Python interface provided by python3-leidenalg.

liblibleidenalg1: 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.

liblibleidenalg1-dbgsym: debug symbols for liblibleidenalg1