Struct ddo::core::implementation::heuristics::MinLP

pub struct MinLP;

This is the default node selection heuristic This heuristic orders the nodes from best to worst by considering the nodes having a minimal longest path as being the wost.

MinLP considers the worst nodes as the ones being the least according to this ordering. This means that in order to sort a vector of nodes from best to worst (ie. to implement restriction), the ordering should be reversed.

Example

let a = Node {state: 'a', info: NodeInfo{lp_len: 42, lp_arc: None, ub: 100, is_exact: true, is_relaxed: false}};
let b = Node {state: 'b', info: NodeInfo{lp_len:  2, lp_arc: None, ub: 100, is_exact: true, is_relaxed: false}};
let c = Node {state: 'c', info: NodeInfo{lp_len: 24, lp_arc: None, ub: 100, is_exact: true, is_relaxed: false}};
let d = Node {state: 'd', info: NodeInfo{lp_len: 13, lp_arc: None, ub: 100, is_exact: true, is_relaxed: false}};
let e = Node {state: 'e', info: NodeInfo{lp_len: 65, lp_arc: None, ub: 100, is_exact: true, is_relaxed: false}};
let f = Node {state: 'f', info: NodeInfo{lp_len: 19, lp_arc: None, ub: 100, is_exact: true, is_relaxed: false}};

let mut nodes = vec![&a, &b, &c, &d, &e, &f];
nodes.sort_by(|x, y| MinLP.compare(x, y).reverse());
assert_eq!(vec![&e, &a, &c, &f, &d, &b], nodes);

Trait Implementations

impl Clone for MinLP

fn clone(&self) -> MinLP

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Compare<Node<T>, Node<T>> for MinLP

fn compare(&self, a: &Node<T>, b: &Node<T>) -> 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>

Borrows the comparator's parameters before comparing them.

fn rev(self) -> Rev<Self>

Reverses the ordering of the comparator.

fn swap(self) -> Swap<Self>

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

fn then<D>(self, then: D) -> Then<Self, D> where
    D: Compare<L, R>, 

Lexicographically combines the comparator with another.

impl Debug for MinLP

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

Formats the value using the given formatter.

impl Default for MinLP

fn default() -> MinLP

Returns the "default value" for a type.