Struct lapjv::LapJV

pub struct LapJV<'a, T: 'a> { /* fields omitted */ }

Implementations

impl<'a, T> LapJV<'a, T> where
    T: LapJVCost, 

Solve LAP problem given cost matrix This is an implementation of the LAPJV algorithm described in: R. Jonker, A. Volgenant. A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing 38, 325-340 (1987)

pub fn new(costs: &'a Matrix<T>) -> Self

pub fn solve(self) -> Result<(Vec<usize>, Vec<usize>), LapJVError>