Package: liblibleidenalg-dev
Source: libleidenalg
Version: 0.11.1-2build2
Architecture: arm64
Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
Installed-Size: 64
Depends: liblibleidenalg1 (= 0.11.1-2build2)
Section: libdevel
Priority: optional
Multi-Arch: same
Homepage: https://github.com/vtraag/libleidenalg
Description: 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.
Original-Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
