mirror of
https://git.FreeBSD.org/ports.git
synced 2024-12-23 04:23:08 +00:00
New port: math/py-seriate: Optimal ordering of elements in a set given their distance matrix
This commit is contained in:
parent
cf341380b7
commit
487805a73f
Notes:
svn2git
2021-03-31 03:12:20 +00:00
svn path=/head/; revision=544126
@ -834,6 +834,7 @@
|
||||
SUBDIR += py-scs
|
||||
SUBDIR += py-seaborn
|
||||
SUBDIR += py-secp256k1
|
||||
SUBDIR += py-seriate
|
||||
SUBDIR += py-simhash
|
||||
SUBDIR += py-slepc4py
|
||||
SUBDIR += py-snuggs
|
||||
|
26
math/py-seriate/Makefile
Normal file
26
math/py-seriate/Makefile
Normal file
@ -0,0 +1,26 @@
|
||||
# $FreeBSD$
|
||||
|
||||
PORTNAME= seriate
|
||||
DISTVERSION= 1.1.2
|
||||
CATEGORIES= math python
|
||||
PKGNAMEPREFIX= ${PYTHON_PKGNAMEPREFIX}
|
||||
|
||||
MAINTAINER= yuri@FreeBSD.org
|
||||
COMMENT= Optimal ordering of elements in a set given their distance matrix
|
||||
|
||||
LICENSE= APACHE20
|
||||
LICENSE_FILE= ${WRKSRC}/LICENSE.md
|
||||
|
||||
RUN_DEPENDS= ${PYNUMPY} \
|
||||
${PYTHON_PKGNAMEPREFIX}or-tools>0:math/py-or-tools@${PY_FLAVOR} \
|
||||
${PYTHON_PKGNAMEPREFIX}packaging>0:devel/py-packaging@${PY_FLAVOR} \
|
||||
${PYTHON_PKGNAMEPREFIX}scipy>0:science/py-scipy@${PY_FLAVOR}
|
||||
|
||||
USES= python
|
||||
USE_GITHUB= yes
|
||||
GH_ACCOUNT= src-d
|
||||
USE_PYTHON= distutils autoplist
|
||||
|
||||
NO_ARCH= yes
|
||||
|
||||
.include <bsd.port.mk>
|
3
math/py-seriate/distinfo
Normal file
3
math/py-seriate/distinfo
Normal file
@ -0,0 +1,3 @@
|
||||
TIMESTAMP = 1596500195
|
||||
SHA256 (src-d-seriate-1.1.2_GH0.tar.gz) = 5e031e865398fbe24aebdbb4a2e0015447aec50478830850f29d38660fd266e3
|
||||
SIZE (src-d-seriate-1.1.2_GH0.tar.gz) = 2498048
|
9
math/py-seriate/pkg-descr
Normal file
9
math/py-seriate/pkg-descr
Normal file
@ -0,0 +1,9 @@
|
||||
This is a Python implementation of Seriation algorithm. Seriation is
|
||||
an approach for ordering elements in a set so that the sum of the sequential
|
||||
pairwise distances is minimal. We state this task as a Travelling Salesman
|
||||
Problem (TSP) and leverage the powerful Google's or-tools to do heavy-lifting.
|
||||
Since TSP is NP-hard, it is not possible to calculate the precise solution for
|
||||
a big number of elements. However, the or-tools' heuristics work very well in
|
||||
practice, and they are used in e.g. Google Maps.
|
||||
|
||||
WWW: https://github.com/src-d/seriate
|
Loading…
Reference in New Issue
Block a user