diff options
| -rw-r--r-- | math/Makefile | 1 | ||||
| -rw-r--r-- | math/planarity/Makefile | 24 | ||||
| -rw-r--r-- | math/planarity/distinfo | 3 | ||||
| -rw-r--r-- | math/planarity/pkg-descr | 9 | ||||
| -rw-r--r-- | math/planarity/pkg-plist | 24 |
5 files changed, 61 insertions, 0 deletions
diff --git a/math/Makefile b/math/Makefile index ca85a50f910e..7edec69f92ca 100644 --- a/math/Makefile +++ b/math/Makefile @@ -691,6 +691,7 @@ SUBDIR += physcalc SUBDIR += picosat SUBDIR += piranha + SUBDIR += planarity SUBDIR += plman SUBDIR += ploticus SUBDIR += ploticus-nox11 diff --git a/math/planarity/Makefile b/math/planarity/Makefile new file mode 100644 index 000000000000..08f17d994cd1 --- /dev/null +++ b/math/planarity/Makefile @@ -0,0 +1,24 @@ +# Created by: thierry@pompo.net +# $FreeBSD$ + +PORTNAME= planarity +PORTVERSION= 3.0.0.5 +DISTVERSIONPREFIX= Version_ +CATEGORIES= math + +MAINTAINER= thierry@FreeBSD.org +COMMENT= Edge Addition Planarity Suite + +LICENSE= BSD3CLAUSE +LICENSE_FILE= ${WRKSRC}/LICENSE.TXT + +USE_GITHUB= yes +GH_ACCOUNT= graph-algorithms +GH_PROJECT= edge-addition-planarity-suite + +USES= autoreconf libtool + +GNU_CONFIGURE= yes +USE_LDCONFIG= yes + +.include <bsd.port.mk> diff --git a/math/planarity/distinfo b/math/planarity/distinfo new file mode 100644 index 000000000000..48afd83aaf67 --- /dev/null +++ b/math/planarity/distinfo @@ -0,0 +1,3 @@ +TIMESTAMP = 1585576072 +SHA256 (graph-algorithms-edge-addition-planarity-suite-Version_3.0.0.5_GH0.tar.gz) = a019eedf67087bba1996c8b9ad47a6f1cda166c2d8976f13bfcff5c0d23e5578 +SIZE (graph-algorithms-edge-addition-planarity-suite-Version_3.0.0.5_GH0.tar.gz) = 164344 diff --git a/math/planarity/pkg-descr b/math/planarity/pkg-descr new file mode 100644 index 000000000000..a6684c2cff08 --- /dev/null +++ b/math/planarity/pkg-descr @@ -0,0 +1,9 @@ +This code project provides a library for implementing graph algorithms as well +as implementations of several planarity-related graph algorithms. The origin of +this project is the reference implementation for the Edge Addition Planarity +Algorithm, which is now the fastest and simplest linear-time method for +planar graph embedding and planarity obstruction isolation (i.e. Kuratowski +subgraph isolation). + +WWW: http://dx.doi.org/10.7155/jgaa.00091 +WWW: https://github.com/graph-algorithms/edge-addition-planarity-suite/ diff --git a/math/planarity/pkg-plist b/math/planarity/pkg-plist new file mode 100644 index 000000000000..1708bc21c053 --- /dev/null +++ b/math/planarity/pkg-plist @@ -0,0 +1,24 @@ +bin/planarity +include/planarity/appconst.h +include/planarity/graph.h +include/planarity/graphDrawPlanar.h +include/planarity/graphDrawPlanar.private.h +include/planarity/graphExtensions.h +include/planarity/graphExtensions.private.h +include/planarity/graphFunctionTable.h +include/planarity/graphK23Search.h +include/planarity/graphK23Search.private.h +include/planarity/graphK33Search.h +include/planarity/graphK33Search.private.h +include/planarity/graphK4Search.h +include/planarity/graphK4Search.private.h +include/planarity/graphStructures.h +include/planarity/listcoll.h +include/planarity/planarity.h +include/planarity/platformTime.h +include/planarity/stack.h +lib/libplanarity.a +lib/libplanarity.so +lib/libplanarity.so.0 +lib/libplanarity.so.0.0.0 +man/man1/planarity.1.gz |