{"categories":[{"label":"Software Development","url":"https://skillfed.io/packages/category/software-development/5"},{"label":"Scientific/Engineering","url":"https://skillfed.io/packages/category/scientific-engineering/2"},{"label":"Artificial Intelligence","url":"https://skillfed.io/packages/category/scientific-engineering-artificial-intelligence/3"},{"label":"Mathematics","url":"https://skillfed.io/packages/category/scientific-engineering-mathematics"},{"label":"Education","url":"https://skillfed.io/packages/category/education"},{"label":"Image Recognition","url":"https://skillfed.io/packages/category/scientific-engineering-image-recognition"},{"label":"Testing","url":"https://skillfed.io/packages/category/education-testing"}],"enrichment":{"capability":"Solves the linear assignment problem using the Jonker-Volgenant (LAPJV) or Volgenant-Mordecai (LAPMOD) algorithm, returning optimal row-to-column assignments for dense or sparse cost matrices.","skillfed_tags":["optimization","graph-algorithms","numerical-computing"],"use_cases":["Object tracking: match detected objects across video frames by minimizing spatial distance cost.","Bipartite graph matching: find optimal pairings in workforce scheduling or resource allocation problems.","Image registration: align keypoints between two images by minimizing coordinate mismatch cost.","Data association: link sensor measurements to tracked targets in multi-object tracking systems.","Auction algorithms: solve procurement or assignment auctions where cost represents bid or preference.","Sequence alignment: match elements between two ordered sequences to minimize dissimilarity."],"what_it_does":"lap is a specialized solver for the linear assignment problem\u2014the task of finding a minimum-cost perfect matching between two sets of items. It implements two algorithms from academic literature: LAPJV (Jonker-Volgenant) for dense cost matrices and LAPMOD (Volgenant-Mordecai) for sparse ones. The package takes a cost matrix as input and returns the total assignment cost plus two index arrays describing which row is assigned to which column and vice versa.\n\nThe solver is built from scratch based on published papers and a public-domain Pascal reference implementation. It returns assignment indices rather than a full assignment matrix, keeping the output compact. The package has wheels for Python 3.7\u20133.14 across Windows, Linux, and macOS, with support for both numpy 1.x and 2.x, making it straightforward to install on most systems.","worth_installing":"Yes. lap is a focused, well-maintained solver for a specific algorithmic problem with no known vulnerabilities, permissive licensing, and broad platform coverage. Install it if you need to solve linear assignment problems and prefer a specialized implementation over a general-purpose optimizer. The medium install friction is offset by pre-built wheels and active maintenance."},"id":"lap","links":{"html":"https://skillfed.io/packages/lap","md":"https://skillfed.io/packages/lap.md","pypi":"https://pypi.org/project/lap/"},"maintenance":{"status":"active"},"meta":{"latest_release":"2026-02-23","license_spdx":null,"license_treatment":"permissive","name":"lap","python_support":"supports_current","summary":"Linear Assignment Problem solver (LAPJV/LAPMOD)."},"popularity":{"monthly_downloads":1749785,"position":3594,"tier":"top_5000"},"security":{"n_vulnerabilities":0},"version":"0.5.13"}