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: <>. 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) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0.1 by Evan Biederstedt, 2 months ago

Report a bug at

Browse source code at

Authors: Peter 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]

Documentation:   PDF Manual  

GPL-3 license

Imports graphics, grDevices, Matrix.utils, parallel, Rcpp, sccore, stats

Depends on Matrix, igraph

Suggests pbapply, testthat

Linking to Rcpp, RcppArmadillo, RcppEigen

System requirements: GNU make

Imported by conos.

See at CRAN