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.

Package details

AuthorMartin L. Jäger
MaintainerRonja Foraita <[email protected]>
LicenseGPL (>= 2)
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the MCL package in your browser

Any scripts or data that you put into this service are public.

MCL documentation built on May 1, 2019, 8:08 p.m.