leidenAlg: Implements the Leiden Algorithm via an R Interface

An R interface to the Leiden algorithm, an iterative community detection algorithm on networks. The algorithm is designed to converge to a partition in which all subsets of all communities are locally optimally assigned, yielding communities guaranteed to be connected. The implementation proves to be fast, scales well, and can be run on graphs of millions of nodes (as long as they can fit in memory). The original implementation was constructed as a python interface "leidenalg" found here: <https://github.com/vtraag/leidenalg>. The algorithm was originally described in Traag, V.A., Waltman, L. & van Eck, N.J. "From Louvain to Leiden: guaranteeing well-connected communities". Sci Rep 9, 5233 (2019) <doi:10.1038/s41598-019-41695-z>.

Getting started

Package details

AuthorPeter Kharchenko [aut], Viktor Petukhov [aut], V.A. Traag [ctb], Gábor Csárdi [ctb], Tamás Nepusz [ctb], Minh Van Nguyen [ctb], Evan Biederstedt [cre, aut]
MaintainerEvan Biederstedt <evan.biederstedt@gmail.com>
URL https://github.com/kharchenkolab/leidenAlg
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the leidenAlg package in your browser

Any scripts or data that you put into this service are public.

leidenAlg documentation built on March 4, 2021, 1:06 a.m.