_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
python-leidenalg 0.9.1
Dependencies: igraph@0.10.7
Propagated dependencies: python-igraph@0.10.4-0.b6ebd8e
Channel: guix
Location: gnu/packages/graph.scm (gnu packages graph)
Home page: https://github.com/vtraag/leidenalg
Licenses: GPL 3+
Synopsis: Community detection in large networks
Description:

Leiden is a general algorithm for methods of community detection in large networks. This package implements the Leiden algorithm in C++ and exposes it to Python. 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.

Total results: 1