Function lapjv::lapjv

pub fn lapjv<T>(
    costs: &Matrix<T>
) -> Result<(Vec<usize>, Vec<usize>), LapJVError> 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)