Enum PathStrategy 

pub enum PathStrategy {
    Greedy,
    Optimal,
}

Strategy for finding the contraction path.

Variants

Greedy

Greedy heuristic: at each step, contract the pair with the smallest intermediate tensor. O(n^3) in the number of operands.

Optimal

Exhaustive search: tries all possible contraction orderings and picks the one with the lowest total FLOP count. O(n!) — only practical for ≤ ~6 operands.

Trait Implementations

impl Clone for PathStrategy

fn clone(&self) -> PathStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PathStrategy

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

Formats the value using the given formatter.

impl PartialEq for PathStrategy

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

impl Eq for PathStrategy

impl StructuralPartialEq for PathStrategy