py-seriate (#19432)
This commit is contained in:
parent
745875b008
commit
b77279e9cc
26
var/spack/repos/builtin/packages/py-seriate/package.py
Normal file
26
var/spack/repos/builtin/packages/py-seriate/package.py
Normal file
@ -0,0 +1,26 @@
|
|||||||
|
# Copyright 2013-2020 Lawrence Livermore National Security, LLC and other
|
||||||
|
# Spack Project Developers. See the top-level COPYRIGHT file for details.
|
||||||
|
#
|
||||||
|
# SPDX-License-Identifier: (Apache-2.0 OR MIT)
|
||||||
|
|
||||||
|
|
||||||
|
class PySeriate(PythonPackage):
|
||||||
|
"""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."""
|
||||||
|
|
||||||
|
homepage = "https://github.com/src-d/seriate"
|
||||||
|
url = "https://github.com/src-d/seriate/archive/1.1.2.tar.gz"
|
||||||
|
|
||||||
|
version('1.1.2', sha256='5e031e865398fbe24aebdbb4a2e0015447aec50478830850f29d38660fd266e3')
|
||||||
|
|
||||||
|
depends_on('py-setuptools', type='build')
|
||||||
|
depends_on('py-numpy@1.0:', type=('build', 'run'))
|
||||||
|
depends_on('py-packaging@16.0:', type=('build', 'run'))
|
||||||
|
depends_on('py-or-tools', type=('build', 'run'))
|
Loading…
Reference in New Issue
Block a user