[−][src]Struct lapjv::LapJV
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)
pub fn new(costs: &'a Matrix<T>) -> Self
[src]
pub fn solve(self) -> Result<(Vec<usize>, Vec<usize>), LapJVError>
[src]
Auto Trait Implementations
impl<'a, T> Send for LapJV<'a, T> where
T: Send + Sync,
T: Send + Sync,
impl<'a, T> Sync for LapJV<'a, T> where
T: Sync,
T: Sync,
Blanket Implementations
impl<T> From for T
[src]
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = !
🔬 This is a nightly-only experimental API. (
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T> Borrow for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,