Ubuntu
libleidenalg package

libleidenalg 0.11.1-2 source package in Ubuntu

Changelog

libleidenalg (0.11.1-2) unstable; urgency=medium

  [ Gianfranco Costamagna ]
  * d/*.symbols*: mark missing symbols with newer glibc/lto (Closes: #1050164)

  [ Étienne Mollier ]
  * d/control: mark liblibleidenalg-dev Multi-Arch: same.

 -- Étienne Mollier <email address hidden>  Tue, 22 Aug 2023 10:27:45 +0200

Upload details

Uploaded by:
Debian Med
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release universe misc

Downloads

File Size SHA-256 Checksum
libleidenalg_0.11.1-2.dsc 2.2 KiB f07f1d76436a8ec5823517ab52d20849e97f8ef7834e0c136f822cc7b8be5ad2
libleidenalg_0.11.1.orig.tar.xz 42.0 KiB b251e29f62feddb8fdadbdbe8b5e495dec5ea124d502cdab3b01395337701d78
libleidenalg_0.11.1-2.debian.tar.xz 5.3 KiB dc47ee5f49c657506ea438edd2b0b1047e5cf60a3400c6cd800922b2c2072527

No changes file available.

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