{"added":null,"apiVersion":1,"behindSince":null,"buildDepends":[],"categories":["math","python"],"comment":"Optimal ordering of elements in a set given their distance matrix","compare":null,"dependentCount":null,"description":"This is a Python implementation of Seriation algorithm. Seriation is\nan approach for ordering elements in a set so that the sum of the sequential\npairwise distances is minimal. We state this task as a Travelling Salesman\nProblem (TSP) and leverage the powerful Google's or-tools to do heavy-lifting.\nSince TSP is NP-hard, it is not possible to calculate the precise solution for\na big number of elements. However, the or-tools' heuristics work very well in\npractice, and they are used in e.g. Google Maps.","flavors":[],"html":"https://daemonports.org/dragonfly/math/py-seriate/","kind":"port","lastUpdate":null,"license":["APACHE20"],"licenses":["Apache-2.0"],"maintainer":"yuri@FreeBSD.org","name":"py312-seriate","newest":true,"newestVersion":"1.1.2","noVulnData":false,"origin":"math/py-seriate","otherSystems":[{"maintainer":"yuri@FreeBSD.org","newest":true,"origin":"math/py-seriate","path":"/math/py-seriate/","system":"FreeBSD","version":"1.1.2_4"},{"maintainer":"yuri@FreeBSD.org","newest":true,"noVulnData":true,"origin":"math/py-seriate","path":"","system":"HardenedBSD","version":"1.1.2_4"},{"maintainer":"yuri@FreeBSD.org","newest":true,"noVulnData":true,"origin":"math/py-seriate","path":"","system":"GhostBSD","version":"1.1.2_4"}],"packages":null,"pkgName":"py312-seriate-1.1.2_4","related":null,"repository":"DPorts","requiredBy":[],"requiredByCount":0,"runDepends":["devel/py-packaging","lang/python312","math/py-numpy","math/py-or-tools","science/py-scipy"],"status":null,"system":"dragonfly","systemLabel":"DragonFly","version":"1.1.2_4","versions":[{"date":"2026-11-11","version":"1.1.2"}],"vulnerabilities":null,"www":"https://github.com/src-d/seriate"}
