Description
Feature Allocation Neighborhood Greedy Search Algorithm.
Description
A neighborhood-based, greedy search algorithm is performed to estimate a feature allocation by minimizing the expected loss based on posterior samples from the feature allocation distribution. The method is currently under peer review but an earlier draft is available in Dahl, Johnson, and Andros (2022+) <doi:10.48550/arXiv.2207.13824>.
README.md
lapjv
Linear Assignment Problem solver using Jonker-Volgenant algorithm
This is rust implementation of the Jonker-Volgenant algorithm for linear assignment problem
Example usage:
use lapjv::lapjv;
let m = Matrix::from_shape_vec((3, 3), vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0]).unwrap();
let result = lapjv(&m).unwrap();
assert_eq!(result.0, vec![2, 0, 1]);
assert_eq!(result.1, vec![1, 2, 0]);