Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Martin L. Jäger |
| Maintainer | Ronja Foraita <foraita@bips.uni-bremen.de> |
| License | GPL (>= 2) |
| Version | 1.0 |
| Package repository | View 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.
