Struct SubProblem

pub struct SubProblem<T> {
    pub state: Arc<T>,
    pub value: isize,
    pub path: Vec<Decision>,
    pub ub: isize,
    pub depth: usize,
}

A subproblem is a residual problem that must be solved in order to complete the resolution of the original problem which had been defined.

Note:

Sub-problems are automatically instantiated from nodes in the exact cut-sets of relaxed decision diagrams. If you are only discovering the API, rest assured.. you don’t need to implement any subproblem yourself.

Fields

state: Arc<T>

The root state of this sub problem

value: isize

The root value of this sub problem

path: Vec<Decision>

The path to traverse to reach this subproblem from the root of the original problem

ub: isize

An upper bound on the objective reachable in this subproblem

depth: usize

The depth of the subproblem with respect to the root problem

Trait Implementations

impl<T: Clone> Clone for SubProblem<T>

fn clone(&self) -> SubProblem<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<X: SubProblemRanking> Compare<SubProblem<<X as SubProblemRanking>::State>> for CompareSubProblem<X>

fn compare( &self, l: &SubProblem<X::State>, r: &SubProblem<X::State>, ) -> Ordering

Compares two values, returning Less, Equal, or Greater if l is less than, equal to, or greater than r, respectively.

fn compares_lt(&self, l: &L, r: &R) -> bool

Checks if l is less than r.

fn compares_le(&self, l: &L, r: &R) -> bool

Checks if l is less than or equal to r.

fn compares_ge(&self, l: &L, r: &R) -> bool

Checks if l is greater than or equal to r.

fn compares_gt(&self, l: &L, r: &R) -> bool

Checks if l is greater than r.

fn compares_eq(&self, l: &L, r: &R) -> bool

Checks if l is equal to r.

fn compares_ne(&self, l: &L, r: &R) -> bool

Checks if l is not equal to r.

fn borrowing(self) -> Borrowing<Self, L, R>

where Self: Sized,

Borrows the comparator’s parameters before comparing them.

fn rev(self) -> Rev<Self>

where Self: Sized,

Reverses the ordering of the comparator.

fn swap(self) -> Swap<Self>

where Self: Sized,

Swaps the comparator’s parameters, maintaining the underlying ordering.

fn then<D>(self, then: D) -> Then<Self, D>

where D: Compare<L, R>, Self: Sized,

Lexicographically combines the comparator with another.

impl<T: Debug> Debug for SubProblem<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for SubProblem<T>

fn eq(&self, other: &SubProblem<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for SubProblem<T>

impl<T> StructuralPartialEq for SubProblem<T>