leidenAlg

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.

Last 30 days

This package has been downloaded 2,106 times in the last 30 days. That's enough downloads to impress a room full of undergrads. A commendable achievement indeed. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 66 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 24,202 times in the last 365 days. The downloads are officially high enough to crash an underfunded departmental server. Quite an accomplishment! The day with the most downloads was Oct 30, 2024 with 197 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.