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

Version: 0.1.0
Depends: R (≥ 3.5.0), Matrix, igraph
Imports: graphics, grDevices, Matrix.utils, parallel, Rcpp (≥ 1.0.5), sccore, stats
LinkingTo: Rcpp, RcppArmadillo, RcppEigen
Suggests: pbapply, testthat
Published: 2020-11-11
Author: 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]
Maintainer: Evan Biederstedt <evan.biederstedt at gmail.com>
BugReports: https://github.com/kharchenkolab/leidenAlg/issues
License: GPL-3
Copyright: See the file COPYRIGHTS for various leidenAlg copyright details
leidenAlg copyright details
URL: https://github.com/kharchenkolab/leidenAlg
NeedsCompilation: yes
SystemRequirements: GNU make
Materials: README
CRAN checks: leidenAlg results


Reference manual: leidenAlg.pdf
Package source: leidenAlg_0.1.0.tar.gz
Windows binaries: r-devel: leidenAlg_0.1.0.zip, r-release: leidenAlg_0.1.0.zip, r-oldrel: not available
macOS binaries: r-release: leidenAlg_0.1.0.tgz, r-oldrel: leidenAlg_0.1.0.tgz


Please use the canonical form https://CRAN.R-project.org/package=leidenAlg to link to this page.