#algorithm #problem #website #lapjv

lapjv

Linear Assignmment Problem solve using Jonker-Volgenant algorithm

5 releases

Uses old Rust 2015

0.2.1 Sep 1, 2021
0.2.0 Nov 2, 2020
0.1.2 Feb 21, 2019
0.1.1 Jul 16, 2018
0.1.0 Mar 13, 2018

#1300 in Algorithms

Download history 7/week @ 2024-12-21 8/week @ 2024-12-28 295/week @ 2025-01-04 245/week @ 2025-01-11 357/week @ 2025-01-18 194/week @ 2025-01-25 318/week @ 2025-02-01 220/week @ 2025-02-08 331/week @ 2025-02-15 265/week @ 2025-02-22 241/week @ 2025-03-01 232/week @ 2025-03-08 175/week @ 2025-03-15 151/week @ 2025-03-22 144/week @ 2025-03-29 93/week @ 2025-04-05

578 downloads per month

MIT license

22KB
535 lines

lapjv

Crates.io Crates.io Build Status

## 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]);

Dependencies

~1.5MB
~28K SLoC