{"added":null,"apiVersion":1,"behindSince":"2026-11-05","buildDepends":[],"categories":["devel","python"],"comment":"Linear Assignment Problem Solver","compare":"/compare/py312-lap/index.json","dependentCount":null,"description":"Lap is a linear assignment problem solver using Jonker-Volgenant algorithm\nfor dense LAPJV or sparse LAPMOD matrices. Both algorithms are implemented\nfrom scratch based solely on the papers and the public domain Pascal\nimplementation provided by A. Volgenant. The LAPMOD implementation seems to\nbe faster than the LAPJV implementation for matrices with a side of more\nthan ~5000 and with less than 50%25 finite coefficients.","flavors":[],"html":"https://daemonports.org/dragonfly/devel/py-lap/","kind":"port","lastUpdate":null,"license":["BSD2CLAUSE"],"licenses":["BSD-2-Clause"],"maintainer":"rodrigo@FreeBSD.org","name":"py312-lap","newest":false,"newestVersion":"0.5.14","noVulnData":false,"origin":"devel/py-lap","otherSystems":[{"maintainer":"rodrigo@FreeBSD.org","newest":true,"origin":"devel/py-lap","path":"/devel/py-lap/","system":"FreeBSD","updated":"2026-11-05","version":"0.5.14"},{"behindSince":"2026-11-05","maintainer":"pkgsrc-users@NetBSD.org","matchedBy":"name","origin":"math/py-lap","path":"/netbsd/math/py-lap/","system":"NetBSD","updated":"2026-11-08","version":"0.5.13nb2"},{"behindSince":"2026-11-05","maintainer":"rodrigo@FreeBSD.org","noVulnData":true,"origin":"devel/py-lap","path":"","system":"HardenedBSD","version":"0.5.13_1"},{"behindSince":"2026-11-05","maintainer":"rodrigo@FreeBSD.org","noVulnData":true,"origin":"devel/py-lap","path":"","system":"GhostBSD","version":"0.5.13_1"}],"packages":null,"pkgName":"py312-lap-0.5.13_1","related":null,"repository":"DPorts","requiredBy":["audio/beets"],"requiredByCount":1,"runDepends":["lang/python312"],"status":null,"system":"dragonfly","systemLabel":"DragonFly","version":"0.5.13_1","versions":[{"date":"2026-11-11","version":"0.5.13"}],"vulnerabilities":null,"www":"https://github.com/gatagat/lap"}