Package: leidenAlg 1.1.4
Evan Biederstedt
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>.
Authors:
leidenAlg_1.1.4.tar.gz
leidenAlg_1.1.4.tar.gz(r-4.5-noble)leidenAlg_1.1.4.tar.gz(r-4.4-noble)
leidenAlg.pdf |leidenAlg.html✨
leidenAlg/json (API)
| # Install 'leidenAlg' in R: |
| install.packages('leidenAlg', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/kharchenkolab/leidenalg/issues
- exampleGraph - Conos graph
Last updated 5 days agofrom:08d5ca3de3. Checks:OK: 1 NOTE: 1. Indexed: no.
| Target | Result | Date |
|---|---|---|
| Doc / Vignettes | OK | Oct 18 2024 |
| R-4.5-linux-x86_64 | NOTE | Oct 18 2024 |
Exports:as.dendrogram.fakeCommunitiesfind_partitionfind_partition_rcppfind_partition_with_repfind_partition_with_rep_rcppleiden.communitymembership.fakeCommunitiesrleiden.community
Dependencies:BHclicolorspacecpp11dplyrdqrngfansifarverFNNgenericsggplot2ggrepelgluegtableigraphirlbaisobandlabelinglatticelifecyclemagrittrMASSMatrixmgcvmunsellnlmepbmcapplypillarpkgconfigplyrpROCR6RColorBrewerRcppRcppAnnoyRcppArmadilloRcppEigenRcppProgressrlangRSpectrascalessccoresitmotibbletidyselectutf8uwotvctrsviridisLitewithr
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Returns pre-calculated dendrogram | as.dendrogram.fakeCommunities |
| Conos graph | exampleGraph |
| Finds the optimal partition using the Leiden algorithm | find_partition |
| Refer to the R function find_partition() For notes of the graph object, refer to https://igraph.org/c/doc/igraph-Basic.html | find_partition_rcpp |
| Finds the optimal partition using the Leiden algorithm with replicate starts | find_partition_with_rep |
| Finds the optimal partition using the Leiden algorithm | find_partition_with_rep_rcpp |
| Leiden algorithm community detection Detects communities using Leiden algorithm (implementation copied from https://github.com/vtraag/leidenalg) | leiden.community |
| Returns pre-calculated membership factor | membership.fakeCommunities |
| Recursive leiden communities Constructs an n-step recursive clustering, using leiden.community | rleiden.community |
