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.
Version: 1.0 Depends: R (≥ 2.10.0) Imports: expm Published: 2015-03-11 DOI: 10.32614/CRAN.package.MCL Author: Martin L. Jäger Maintainer: Ronja Foraita <foraita at bips.uni-bremen.de> License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] NeedsCompilation: no CRAN checks: MCL results Documentation: Downloads: Reverse dependencies: Linking:Please use the canonical form https://CRAN.R-project.org/package=MCL to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4