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.
| Version: |
1.0 |
| Depends: |
R (≥ 2.10.0) |
| Imports: |
expm |
| Published: |
2015-03-11 |
| Author: |
Martin L. Jäger |
| Maintainer: |
Ronja Foraita <foraita at bips.uni-bremen.de> |
| License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: |
no |
| CRAN checks: |
MCL results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=MCL
to link to this page.