Struct sparse_linear_assignment::solution::AuctionSolution

pub struct AuctionSolution<I> where
    I: UnsignedInt,  {
    pub person_to_object: Vec<I>,
    pub object_to_person: Vec<I>,
    pub num_unassigned: I,
    pub eps: f64,
}

Solution of the linear assignment problem

Fields

person_to_object: Vec<I>

index i gives the object, j, owned by person i

Unassigned people are marked by MAX value of the integer type (u32::MAX for u32)

object_to_person: Vec<I>

index j gives the person, i, who owns object j

Unassigned objects are marked by MAX value of the integer type (u32::MAX for u32)

num_unassigned: I

number of unnassigned people in case perfect matching doesn’t exist

eps: f64

found solution is ε-optimal if perfect matching exists. For integer weights small enough ε gives optimum.

Implementations

impl<I> AuctionSolution<I> where
    I: UnsignedInt, 

pub fn new(row_capacity: usize, column_capacity: usize) -> AuctionSolution<I>

Trait Implementations

impl<I: Clone> Clone for AuctionSolution<I> where
    I: UnsignedInt, 

fn clone(&self) -> AuctionSolution<I>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I: Debug> Debug for AuctionSolution<I> where
    I: UnsignedInt, 

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.