diff options
| author | Yuri Victorovich <yuri@FreeBSD.org> | 2021-09-03 19:19:27 -0700 |
|---|---|---|
| committer | Yuri Victorovich <yuri@FreeBSD.org> | 2021-09-03 20:58:20 -0700 |
| commit | 8945e333ef7d80bc0465f6230334dd121cffa0e1 (patch) | |
| tree | 835f6c15567bb5757000525e02362577fc4d0720 /math/plantri | |
| parent | sysutils/mcelog: Updated to 178 (diff) | |
math/plantri: New port: Plantri and fullgen are programs to generate planar graph
Diffstat (limited to 'math/plantri')
| -rw-r--r-- | math/plantri/Makefile | 20 | ||||
| -rw-r--r-- | math/plantri/distinfo | 3 | ||||
| -rw-r--r-- | math/plantri/pkg-descr | 12 |
3 files changed, 35 insertions, 0 deletions
diff --git a/math/plantri/Makefile b/math/plantri/Makefile new file mode 100644 index 000000000000..291d494a0fe6 --- /dev/null +++ b/math/plantri/Makefile @@ -0,0 +1,20 @@ +PORTNAME= plantri +DISTVERSION= 5.2 +CATEGORIES= math +MASTER_SITES= http://users.cecs.anu.edu.au/~bdm/plantri/ +DISTNAME= ${PORTNAME}${DISTVERSION:S/.//} + +MAINTAINER= yuri@FreeBSD.org +COMMENT= Plantri and fullgen are programs to generate planar graph + +MAKEFILE= makefile +MAKE_ARGS= CC=${CC} CFLAGS="${CFLAGS}" + +PLIST_FILES= bin/plantri \ + bin/fullgen + +do-install: + ${INSTALL_PROGRAM} ${WRKSRC}/plantri ${STAGEDIR}${PREFIX}/bin + ${INSTALL_PROGRAM} ${WRKSRC}/fullgen ${STAGEDIR}${PREFIX}/bin + +.include <bsd.port.mk> diff --git a/math/plantri/distinfo b/math/plantri/distinfo new file mode 100644 index 000000000000..8c264eacf92f --- /dev/null +++ b/math/plantri/distinfo @@ -0,0 +1,3 @@ +TIMESTAMP = 1630721063 +SHA256 (plantri52.tar.gz) = 82bcb29f7aeb25eb9668aa6032ef27e35ea94125dc21d319f3664da06b5b8b12 +SIZE (plantri52.tar.gz) = 212765 diff --git a/math/plantri/pkg-descr b/math/plantri/pkg-descr new file mode 100644 index 000000000000..97cf889e439a --- /dev/null +++ b/math/plantri/pkg-descr @@ -0,0 +1,12 @@ +plantri and fullgen are programs for generation of certain types of planar +graph. + +Exactly one member of each isomorphism class is output, using an amount of +memory almost independent of the number of graphs produced. This, together with +the exceptionally fast operation and careful validation, makes the program +suitable for processing very large numbers of graphs. + +Isomorphisms are defined with respect to the embeddings, so in some cases +outputs may be isomorphic as abstract graphs. + +WWW: https://users.cecs.anu.edu.au/~bdm/plantri/ |