[][src]Struct ddo::core::implementation::heuristics::FromLongestPath

pub struct FromLongestPath { /* fields omitted */ }

This is the default strategy to recover the set of free variables from a node This strategy retrieves the set of free variables from a node by walking the set of variables assigned along the longest path to the current node.

It starts from the full set of variables (problem.all_vars()) and iteratively removes the variables that have been assigned a value on the longest path.

Methods

impl FromLongestPath[src]

pub fn new(all_vars: VarSet) -> FromLongestPath[src]

This function creates a FromLongestPath heuristic from a reference to the problem being solved.

Trait Implementations

impl Clone for FromLongestPath[src]

impl Debug for FromLongestPath[src]

impl<T> LoadVars<T> for FromLongestPath[src]

fn variables(&self, node: &Node<T>) -> VarSet[src]

Returns the set of variables having no assigned value along the longest path to node.

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.