MCL

Markov Cluster Algorithm for graphs

The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm for graphs based on simulation of (stochastic) flow in graphs. The algorithm was invented/discovered by Stijn van Dongen at the Centre for Mathematics and Computer Science (also known as CWI) in the Netherlands.

License: GNU GPL.

Tags: discrete mathematics, graph theory, statistics.

Interface: command line.

Source language: C.

Staff

Developer: Stijn van Dongen.

Links

Homepage: http://micans.org/mcl/.

Documentation: http://micans.org/mcl/man/.