Third-party Slackware packages built with slackrepo on Slackware64-current. Use at your own risk. All packages are signed with my GPG key.
| Name | Last modified | Size | |
|---|---|---|---|
| Parent Directory | - | ||
| python3-lap-0.5.12-x86_64-1_danix.txz.md5 | 2026-05-12 11:11 | 72 | |
| python3-lap-0.5.12-x86_64-1_danix.txz.asc | 2026-05-12 11:11 | 870 | |
| python3-lap-0.5.12-x86_64-1_danix.txt | 2026-05-12 11:11 | 667 | |
| python3-lap-0.5.12-x86_64-1_danix.meta | 2026-05-12 11:11 | 899 | |
| python3-lap-0.5.12-x86_64-1_danix.lst | 2026-05-12 11:11 | 5.3K | |
| python3-lap-0.5.12-x86_64-1_danix.txz.sha256 | 2026-05-06 13:31 | 104 | |
| python3-lap-0.5.12-x86_64-1_danix.txz | 2026-05-06 13:31 | 1.4M | |
python3-lap (Linear Assignment Problem solver LAPJV/LAPMOD)
lap is a linear assignment problem solver using Jonker-Volgenant
algorithm for dense LAPJV or sparse LAPMOD matrices. Both algorithms
are implemented from scratch based solely on the papers and the
public domain Pascal implementation provided by A. Volgenant. The
LAPMOD implementation seems to be faster than the LAPJV implementation
for matrices with a side of more than ~5000 and with less than 50%
finite coefficients.