Commit Graph

10 Commits

Author SHA1 Message Date
bernd
a925bc4eb7 Update to mcl-06-058.
From MAINTAINER Andreas Kahari.

"go ahead" steven@
2006-04-05 08:58:44 +00:00
naddy
c50278f38b Update to 05-118.
Major changes includes speed improvements when reading large matrices
from file and the addition of the clmorder tool.

From: maintainer Andreas Kahari <andreas.kahari@gmail.com>
2005-07-26 18:50:43 +00:00
naddy
8e0d7f62ec SIZE 2005-01-05 17:05:00 +00:00
naddy
dd86cf60b1 update to 04-314; from Andreas Kahari <andreas.kahari@gmail.com> 2004-12-18 16:31:52 +00:00
naddy
4e1f11b7aa update MAINTAINER's E-mail address; from Andreas Kahari 2004-12-18 16:23:07 +00:00
espie
d7c7e778ad new style PLISTs 2004-09-15 09:11:58 +00:00
naddy
5872e0c774 update to 04-174; from Andreas Kahari <ak+openbsd@freeshell.org> 2004-06-30 23:30:05 +00:00
pvalchev
a38e0d9846 Update to mcl-04-105
from maintainer Andreas Kahari <andreas.kahari@unix.net>
2004-05-07 23:35:51 +00:00
naddy
af2d20b35b update to 03-276; from Andreas Kahari <andreas.kahari@unix.net> 2003-10-17 19:22:07 +00:00
sturm
1e37926ab8 Initial import of mcl 03-185
The MCL algorithm is short for the Markov Cluster Algorithm,
a fast and scalable cluster algorithm for graphs based on
simulation of (stochastic) flow in graphs.  The algorithm was
developed by Stijn van Dongen at the Centre for Mathematics and
Computer Science (also known as CWI) in the Netherlands.

The MCL algorithm is very fast, very scalable, and has a number
of attractive properties causing it to deliver high-quality
clusterings.

WWW: http://micans.org/mcl/

from Andreas Kahari <andreas.kahari@unix.net>
2003-07-08 10:55:20 +00:00