MCL
Markov Cluster Algorithm
Contains the Markov cluster algorithm (MCL) for identifying clusters in networks and graphs. The algorithm simulates random walks on a (n x n) matrix as the adjacency matrix of a graph. It alternates an expansion step and an inflation step until an equilibrium state is reached.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0 |
rolling linux/jammy R-4.5 | MCL_1.0.tar.gz |
17.3 KiB |
1.0 |
rolling linux/noble R-4.5 | MCL_1.0.tar.gz |
17.2 KiB |
1.0 |
rolling source/ R- | MCL_1.0.tar.gz |
3.4 KiB |
1.0 |
latest linux/jammy R-4.5 | MCL_1.0.tar.gz |
17.3 KiB |
1.0 |
latest linux/noble R-4.5 | MCL_1.0.tar.gz |
17.2 KiB |
1.0 |
latest source/ R- | MCL_1.0.tar.gz |
3.4 KiB |
1.0 |
2026-04-26 source/ R- | MCL_1.0.tar.gz |
3.4 KiB |
1.0 |
2026-04-23 source/ R- | MCL_1.0.tar.gz |
3.4 KiB |
1.0 |
2026-04-09 windows/windows R-4.5 | MCL_1.0.zip |
19.8 KiB |
1.0 |
2025-04-20 source/ R- | MCL_1.0.tar.gz |
3.4 KiB |