assignment
module unitrack.assignmentLinear-assignment problem (LAP) solvers over a cost matrix.
For new code prefer :func:`auto_assignment` / :class:`AutoLAP`. Both
route to the empirically-fastest backend for the given input; the CPU
LAPJV path currently beats every CUDA solver across the benchmarked
size range (see ``assets/benchmarks/`` for the data).
Members
module
- associateAssociate — bridges a CostExpression to a hard assignment.
- clip_associateClipAssociator abstract base — extension point for clip-global solvers.
- lapCUDA LAP solvers backed by :mod:`torchmatch.assignment`.
- lapjvCPU LAP solvers backed by :mod:`torchmatch.assignment`.
type
- AssignmentBase class for linear-assignment-problem solvers.
- AssociateMaterialise a :class:`~unitrack.data.CostExpression` and run an :class:`Assignment`.
- AuctionBertsekas auction solver for the linear assignment problem.
- AutoLAP:class:`Assignment` wrapper around the auto-dispatched LAP solver.
- ClipAssociatorAbstract base for clip-global matchers.
- GreedyGreedy nearest-neighbour linear-assignment solver.
- HungarianHungarian-algorithm LAP solver wrapping the SciPy implementation.
- JonkerJonker-Volgenant LAP solver backed by the rectangular LAPJV CPU backend.
- LAPJVS:class:`Assignment` wrapper for the square Jonker-Volgenant solver.
- LAPJVX:class:`Assignment` wrapper for the rectangular Jonker-Volgenant solver.
- PreferBackend preference for :func:`auto_assignment` and :class:`AutoLAP`.
- SoftAssignmentDifferentiable linear-assignment solver using Sinkhorn iterations.
function
- auction_assignmentSolve a linear assignment problem using Bertsekas' auction algorithm.
- auto_assignmentSolve a single LAP via the empirically-fastest backend.
- auto_batch_assignmentSolve a batch of LAPs via the empirically-fastest backend.
- gather_total_costSum the cost-matrix entries selected by a row-column assignment.
- greedy_assignmentAssign rows to columns by repeatedly picking the cheapest free pair.
- hungarian_assignmentSolve a LAP via SciPy's Hungarian implementation.
- jonker_volgenant_assignmentSolve a LAP via the Jonker-Volgenant algorithm with a cost threshold.
- lapjvs_assignmentSolve a single square LAP via the Jonker-Volgenant solver.
- lapjvs_batch_assignmentSolve a batch of square LAPs via the Jonker-Volgenant solver.
- lapjvx_assignmentSolve a single LAP via the rectangular Jonker-Volgenant solver.
- lapjvx_batch_assignmentSolve a batch of LAPs via the rectangular Jonker-Volgenant solver.
- sinkhorn_log_planCompute a log-domain Sinkhorn transport plan for a cost matrix.
- soft_assignmentDerive a discrete assignment from a Sinkhorn transport plan.
Source: unitrack/assignment/__init__.py:1