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.

AuthorMartin L. J├Ąger
Date of publication2015-03-11 09:56:32
MaintainerRonja Foraita <foraita@bips.uni-bremen.de>
LicenseGPL (>= 2)
Version1.0

View on CRAN

Files

MCL
MCL/NAMESPACE
MCL/R
MCL/R/mcl.R
MCL/MD5
MCL/DESCRIPTION
MCL/man
MCL/man/MCL-package.Rd MCL/man/mcl.Rd

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.