Struct lapjv::LapJV
[−]
[src]
pub struct LapJV<'a, T: 'a> { /* fields omitted */ }
Methods
impl<'a, T> LapJV<'a, T> where
T: LapJVCost,
[src]
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)