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.
|Author||Martin L. Jäger|
|Date of publication||2015-03-11 09:56:32|
|Maintainer||Ronja Foraita <email@example.com>|
|License||GPL (>= 2)|
|Package repository||View on CRAN|
|Installation||Install the latest version of this package by entering the following in R:
|mcl: Markov Cluster Algorithm|
|MCL-package: Markov Cluster Algorithm|
|mcl||Man page Source code|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.