MCL: Markov Cluster Algorithm (original) (raw)

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.

Documentation:

Downloads:

Reverse dependencies:

Linking:

Please use the canonical formhttps://CRAN.R-project.org/package=MCLto link to this page.