as_assignment_matrix

Turns a tidy assignment result back into a 0/1 assignment matrix.

Solves optimal pairing and matching problems using linear assignment
algorithms. Provides implementations of the Hungarian method (Kuhn 1955)
<doi:10.1002/nav.3800020109>, Jonker-Volgenant shortest path algorithm
(Jonker and Volgenant 1987) <doi:10.1007/BF02278710>, Auction algorithm
(Bertsekas 1988) <doi:10.1007/BF02186476>, cost-scaling
(Goldberg and Kennedy 1995) <doi:10.1007/BF01585996>, scaling algorithms
(Gabow and Tarjan 1989) <doi:10.1137/0218069>, push-relabel (Goldberg and
Tarjan 1988) <doi:10.1145/48014.61051>, and Sinkhorn entropy-regularized
transport (Cuturi 2013) <doi:10.48550/arxiv.1306.0895>. Designed for
matching plots, sites, samples, or any pairwise optimization problem.
Supports rectangular matrices, forbidden assignments, data frame inputs,
batch solving, k-best solutions, and pixel-level image morphing for
visualization. Includes automatic preprocessing with variable health
checks, multiple scaling methods (standardized, range, robust), greedy
matching algorithms, and comprehensive balance diagnostics for assessing
match quality using standardized differences and distribution comparisons.

Gilles Colling

couplr

Optimal Pairing and Matching via Linear Assignment

as_assignment_matrix function

<dl><dt>x</dt>
<dd>An assignment result object of class <code>lap_solve_result</code></dd>
<dt>n_sources</dt>
<dd>Number of source nodes, optional</dd>
<dt>n_targets</dt>
<dd>Number of target nodes, optional</dd></dl>

Arguments

Convert assignment result to a binary matrix — as_assignment_matrix

<dl>

<dt>x</dt>
<dd>An assignment result object of class <code>lap_solve_result</code></dd>


<dt>n_sources</dt>
<dd>Number of source nodes, optional</dd>


<dt>n_targets</dt>
<dd>Number of target nodes, optional</dd>

</dl>

as_assignment_matrix: Convert assignment result to a binary matrix

Description

Usage

Value

Arguments