BSD Ports

math/py-seriate 1.1.2_4 DragonFly

Optimal ordering of elements in a set given their distance matrix

System
DragonFly
Repository
DPorts
Maintainer
[email protected] (as in FreeBSD)
License
APACHE20
Categories
math, python
Package size
11.4 KiB, 36.2 KiB installed

Description

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.

In the other systems

The newest version among them is 1.1.2, as upstream numbers it.

SystemPortVersionVulnerabilitiesStatusMaintainerLast update
DragonFlymath/py-seriate1.1.2_4 newestnone known-[email protected]-
FreeBSDmath/py-seriate1.1.2_4 newestnone known-[email protected]-
HardenedBSDmath/py-seriate1.1.2_4 newestno data-[email protected]-
GhostBSDmath/py-seriate1.1.2_4 newestno data-[email protected]-

Version history 1

  1. 1.1.2

Upstream's version as each commit to the port's Makefile set it, or as this site first saw it in the system's packages; the tree's own revisions are not versions here.

Install

Binary package:

pkg install py312-seriate

From DPorts:

cd /usr/dports/math/py-seriate && make install clean

Dependency graph

Ports that need it on the left, what it needs to run on the right; at most 8 of each. "Dependencies" below lists them all.

Dependencies

Run dependencies 5

No port depends on this one.