软件包：python3-leidenalg（0.9.1-1 以及其他的）
python3-leidenalg 的相关链接
Debian 的资源：
下载源码包 python-leidenalg：
- [python-leidenalg_0.9.1-1.dsc]
- [python-leidenalg_0.9.1.orig.tar.gz]
- [python-leidenalg_0.9.1-1.debian.tar.xz]
维护小组：
- Debian Med Packaging Team (QA 页面, 邮件存档)
- Andreas Tille (QA 页面)
- Nilesh Patra (QA 页面)
- Étienne Mollier (QA 页面)
外部的资源：
- 主页 [github.com]
相似软件包：
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.29)
- GNU C 语言运行库：共享库
同时作为一个虚包由这些包填实： libc6-udeb
-
- dep: libgcc-s1 (>= 3.0)
- GCC 支持库
-
- dep: libigraph3 (>= 0.10.0)
- library for creating and manipulating graphs
-
- dep: libstdc++6 (>= 11)
- GNU 标准 C++ 库，第3版
-
- dep: python3
- 交互式高级面向对象语言（默认 python3 版本）
- dep: python3 (<< 3.12)
- dep: python3 (>= 3.11~)
-
- dep: python3-igraph (>= 0.10)
- High performance graph data structures and algorithms (Python 3)
-
- dep: python3-pkg-resources
- Package Discovery and Resource Access using pkg_resources