cpet/openbsd-ports
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
4536af7348
openbsd-ports/math/mcl/Makefile

28 lines
491 B
Makefile
Raw Normal View History

USE_GROFF=Yes
2010-10-18 16:52:05 -04:00
# $OpenBSD: Makefile,v 1.11 2010/10/18 20:52:06 espie Exp $
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 06:55:20 -04:00
remove quotes from COMMENT/PERMIT*/BROKEN
2007-09-15 14:44:36 -04:00
COMMENT= clustering algorithm for graphs
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 06:55:20 -04:00
- update mcl to 09-308 - remove maintainer per his request - specify license version
2009-12-23 17:08:58 -05:00
V= 09-308
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 06:55:20 -04:00
DISTNAME= mcl-${V}
PKGNAME= mcl-${V:S,-,_,}
CATEGORIES= math
HOMEPAGE= http://micans.org/mcl/
- update mcl to 09-308 - remove maintainer per his request - specify license version
2009-12-23 17:08:58 -05:00
# GPLv2
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 06:55:20 -04:00
PERMIT_PACKAGE_CDROM= Yes
PERMIT_PACKAGE_FTP= Yes
PERMIT_DISTFILES_CDROM= Yes
PERMIT_DISTFILES_FTP= Yes
- update mcl to 09-308 - remove maintainer per his request - specify license version
2009-12-23 17:08:58 -05:00
MASTER_SITES= ${HOMEPAGE}/src/
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 06:55:20 -04:00
update to 04-314; from Andreas Kahari <andreas.kahari@gmail.com>
2004-12-18 11:31:52 -05:00
WANTLIB= c m pthread
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 06:55:20 -04:00
CONFIGURE_STYLE=gnu
USE_GROFF=Yes
2010-10-18 16:52:05 -04:00
USE_GROFF = Yes
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 06:55:20 -04:00
- update mcl to 09-308 - remove maintainer per his request - specify license version
2009-12-23 17:08:58 -05:00
FAKE_FLAGS= exampledir=${PREFIX}/share/examples/mcl/
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 06:55:20 -04:00
.include <bsd.port.mk>
Reference in New Issue Copy Permalink