Enum EliminationStrategy 

pub enum EliminationStrategy {
    MinDegree,
    MinFill,
    WeightedMinFill,
    MinWidth,
    MaxCardinalitySearch,
}

Strategy for computing variable elimination ordering.

Variants

MinDegree

Min-degree: Choose variable with fewest neighbors

MinFill

Min-fill: Choose variable that introduces fewest new edges

WeightedMinFill

Weighted min-fill: Min-fill weighted by factor sizes

MinWidth

Min-width: Minimize the width of the induced tree

MaxCardinalitySearch

Max-cardinality search: Greedy algorithm that tends to produce good orderings

Trait Implementations

impl Clone for EliminationStrategy

fn clone(&self) -> EliminationStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EliminationStrategy

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

Formats the value using the given formatter.

impl Default for EliminationStrategy

fn default() -> EliminationStrategy

Returns the “default value” for a type.

impl PartialEq for EliminationStrategy

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

impl Eq for EliminationStrategy

impl StructuralPartialEq for EliminationStrategy