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.
[email protected] is safe to use (health: 49/100)
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/conda/r-mclFirst published · 2021-05-25 05:27:11.529000+00:00
Last updated · 2025-09-22 23:53:56.489000+00:00