Enum AssignmentCertificate 

pub enum AssignmentCertificate<C> {
    MinCostFlow {
        potentials: Vec<C>,
    },
    OrderPreserving {
        suffix_costs: Vec<Vec<C>>,
    },
}

Optimality witness for one of the two assignment solvers.

Variants

MinCostFlow

Feasible min-cost flow plus node potentials proving every residual edge has non-negative reduced cost.

Fields

potentials: Vec<C>

Dual potential for every node in the canonical assignment network.

OrderPreserving

Bellman table proving every suffix has the stated minimum cost under the no-crossing recurrence.

Fields

suffix_costs: Vec<Vec<C>>

(source, target) suffix costs, including the terminal row/column.

Trait Implementations

impl<C> Clone for AssignmentCertificate<C>

where C: Clone,

fn clone(&self) -> AssignmentCertificate<C>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<C> Debug for AssignmentCertificate<C>

where C: Debug,

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

Formats the value using the given formatter.

impl<C> Eq for AssignmentCertificate<C>

where C: Eq,

impl<C> PartialEq for AssignmentCertificate<C>

where C: PartialEq,

fn eq(&self, other: &AssignmentCertificate<C>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<C> StructuralPartialEq for AssignmentCertificate<C>

where C: PartialEq,