Enum LowerBoundAlgorithm 

pub enum LowerBoundAlgorithm {
    OneTree,
    MST,
    MSTQueue,
}

Variants

OneTree

The one tree lower bound

MST

The MST lower bound

MSTQueue

The MST lower bound, computed with prims algorithm using a priority queue

Trait Implementations

impl Clone for LowerBoundAlgorithm

fn clone(&self) -> LowerBoundAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LowerBoundAlgorithm

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

Formats the value using the given formatter.

impl Ord for LowerBoundAlgorithm

fn cmp(&self, other: &LowerBoundAlgorithm) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for LowerBoundAlgorithm

fn eq(&self, other: &LowerBoundAlgorithm) -> 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 PartialOrd for LowerBoundAlgorithm

fn partial_cmp(&self, other: &LowerBoundAlgorithm) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl ValueEnum for LowerBoundAlgorithm

fn value_variants<'a>() -> &'a [Self]

All possible argument values, in display order.

fn to_possible_value<'a>(&self) -> Option<PossibleValue>

The canonical argument value.

fn from_str(input: &str, ignore_case: bool) -> Result<Self, String>

Parse an argument into Self.

impl Copy for LowerBoundAlgorithm

impl Eq for LowerBoundAlgorithm

impl StructuralPartialEq for LowerBoundAlgorithm