DESCRIPTION

Package: leidenAlg
Type: Package
Title: Implements the Leiden Algorithm via an R Interface
Version: 0.1.0
Date: 2020-08-18
Authors@R: c(person("Peter", "Kharchenko", email = "Peter_Kharchenko@hms.harvard.edu", role = c("aut")), person("Viktor", "Petukhov", email = "viktor.s.petukhov@ya.ru", role = c("aut")), person("Evan", "Biederstedt", email = "evan.biederstedt@gmail.com", role=c("cre", "aut")))
Description: 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 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>.
License: GPL-3 
Encoding: UTF-8
LazyData: true
Imports: 
	graphics,
    grDevices,
    igraph,
    parallel, 
    Rcpp (>= 1.0.5), 
    stats,
Suggests:
    pbapply
LinkingTo: Rcpp, RcppArmadillo, RcppEigen
SystemRequirements: GNU make
RoxygenNote: 7.1.1
URL: https://github.com/kharchenkolab/leidenAlg
BugReports: https://github.com/kharchenkolab/leidenAlg/issues
NeedsCompilation: yes
Author: Peter Kharchenko [aut], Viktor Petukhov [aut], Evan Biederstedt [cre, aut]
Maintainer: Evan Biederstedt <evan.biederstedt@gmail.com>