IABSD.fr/ports/math/mcl
Branch :
Log
| Author | Commit | Date | CI | Message |
|---|---|---|---|---|
 |
c50278f3 | 2005-07-26 18:50:43 | 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> | |
|
8e0d7f62 | 2005-01-05 17:05:00 | SIZE | |
|
dd86cf60 | 2004-12-18 16:31:52 | update to 04-314; from Andreas Kahari <andreas.kahari@gmail.com> | |
|
4e1f11b7 | 2004-12-18 16:23:07 | update MAINTAINER's E-mail address; from Andreas Kahari | |
 |
d7c7e778 | 2004-09-15 09:11:58 | new style PLISTs | |
|
5872e0c7 | 2004-06-30 23:30:05 | update to 04-174; from Andreas Kahari <ak+openbsd@freeshell.org> | |
 |
a38e0d98 | 2004-05-07 23:35:51 | Update to mcl-04-105 from maintainer Andreas Kahari <andreas.kahari@unix.net> | |
|
af2d20b3 | 2003-10-17 19:22:07 | update to 03-276; from Andreas Kahari <andreas.kahari@unix.net> | |
 |
1e37926a | 2003-07-08 10:55:20 | 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> |