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.
copied from cf-staging / r-mcl
https://anaconda.org/conda-forge/r-mcl/badges/version.svg
https://anaconda.org/conda-forge/r-mcl/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-mcl/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-mcl/badges/platforms.svg
https://anaconda.org/conda-forge/r-mcl/badges/license.svg
https://anaconda.org/conda-forge/r-mcl/badges/downloads.svg