openbsd-ports/math/mcl/Makefile

# $OpenBSD: Makefile,v 1.7 2005/07/26 18:50:43 naddy Exp $

COMMENT=	"clustering algorithm for graphs"

V=		05-118
DISTNAME=	mcl-${V}
PKGNAME=	mcl-${V:S,-,_,}
CATEGORIES=	math

HOMEPAGE=	http://micans.org/mcl/

MAINTAINER=	Andreas Kahari <andreas.kahari@gmail.com>

# GPL
PERMIT_PACKAGE_CDROM=	Yes
PERMIT_PACKAGE_FTP=	Yes
PERMIT_DISTFILES_CDROM=	Yes
PERMIT_DISTFILES_FTP=	Yes

MASTER_SITES=	${HOMEPAGE}src/

WANTLIB=	c m pthread

CONFIGURE_STYLE=gnu

.include <bsd.port.mk>
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			`# $OpenBSD: Makefile,v 1.7 2005/07/26 18:50:43 naddy 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 10:55:20 +00:00
			`COMMENT= "clustering algorithm for graphs"`

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			`V= 05-118`
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			`DISTNAME= mcl-${V}`
			`PKGNAME= mcl-${V:S,-,_,}`
			`CATEGORIES= math`

			`HOMEPAGE= http://micans.org/mcl/`

update MAINTAINER's E-mail address; from Andreas Kahari 2004-12-18 16:23:07 +00:00			`MAINTAINER= Andreas Kahari <andreas.kahari@gmail.com>`
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
			`# GPL`
			`PERMIT_PACKAGE_CDROM= Yes`
			`PERMIT_PACKAGE_FTP= Yes`
			`PERMIT_DISTFILES_CDROM= Yes`
			`PERMIT_DISTFILES_FTP= Yes`

update to 03-276; from Andreas Kahari <andreas.kahari@unix.net> 2003-10-17 19:22:07 +00: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 10:55:20 +00:00
update to 04-314; from Andreas Kahari <andreas.kahari@gmail.com> 2004-12-18 16:31:52 +00: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 10:55:20 +00:00			`CONFIGURE_STYLE=gnu`

			`.include <bsd.port.mk>`