diff options
| -rw-r--r-- | math/suitesparse-btf/Makefile | 18 | ||||
| -rw-r--r-- | math/suitesparse-btf/pkg-descr | 11 | ||||
| -rw-r--r-- | math/suitesparse-btf/pkg-plist | 5 |
3 files changed, 34 insertions, 0 deletions
diff --git a/math/suitesparse-btf/Makefile b/math/suitesparse-btf/Makefile new file mode 100644 index 000000000000..f6bcb1f8b5a9 --- /dev/null +++ b/math/suitesparse-btf/Makefile @@ -0,0 +1,18 @@ +# Created by: Thierry Thomas (<thierry@pompo.net>) + +PORTNAME= BTF +PORTVERSION= 1.2.6 +CATEGORIES= math + +COMMENT= Permutation to block triangular form + +LICENSE= LGPL21+ + +USES= localbase:ldflags +OMP_NEEDED= yes + +BUILD_WRKSRC= ${WRKSRC}/${PORTNAME} +USE_LDCONFIG= yes + +.include "${.CURDIR}/../../math/suitesparse/bsd.suitesparse.mk" +.include <bsd.port.post.mk> diff --git a/math/suitesparse-btf/pkg-descr b/math/suitesparse-btf/pkg-descr new file mode 100644 index 000000000000..5f8a5d5c1373 --- /dev/null +++ b/math/suitesparse-btf/pkg-descr @@ -0,0 +1,11 @@ +This port installs the module BTF of SuiteSparse. + +BTF is a software package for permuting a matrix into block upper triangular +form. It includes a maximum transversal algorithm, which finds a permutation +of a square or rectangular matrix so that it has a zero-free diagonal (if one +exists); otherwise, it finds a maximal matching which maximizes the number of +nonzeros on the diagonal. The package also includes a method for finding the +strongly connected components of a graph. These two methods together give the +permutation to block upper triangular form. + +WWW: http://faculty.cse.tamu.edu/davis/suitesparse.html diff --git a/math/suitesparse-btf/pkg-plist b/math/suitesparse-btf/pkg-plist new file mode 100644 index 000000000000..393ebeacf29d --- /dev/null +++ b/math/suitesparse-btf/pkg-plist @@ -0,0 +1,5 @@ +include/suitesparse/btf.h +lib/libbtf.so +lib/libbtf.so.1 +lib/libbtf.so.1.2.6 +%%PORTDOCS%%%%DOCSDIR%%/BTF_README.txt |