exampleGraph

datasets

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

Evan Biederstedt

leidenAlg

Implements the Leiden Algorithm via an R Interface

Peter Kharchenko

Viktor Petukhov

Yichen Wang

V.A. Traag

Gábor Csárdi

Tamás Nepusz

Minh Van Nguyen

exampleGraph function

<p>An object of class <code>igraph</code> of length 100.</p>

Format

Conos graph — exampleGraph

Conos graph

exampleGraph: Conos graph

Description

Usage

Arguments

Format