[−][src]Trait ddo::abstraction::heuristics::NodeSelectionHeuristic
This trait defines an heuristic to rank the nodes in order to remove (or merge) the less relevant ones from an MDD that is growing too large.
Required methods
fn compare(
&self,
a: &dyn SelectableNode<T>,
b: &dyn SelectableNode<T>
) -> Ordering
&self,
a: &dyn SelectableNode<T>,
b: &dyn SelectableNode<T>
) -> Ordering
Defines an order of 'relevance' over the nodes a
and b
. Greater means
that a
is more important (hence more likely to be kept) than b
.
Implementors
impl<T> NodeSelectionHeuristic<T> for MinLP
[src]
fn compare(
&self,
a: &dyn SelectableNode<T>,
b: &dyn SelectableNode<T>
) -> Ordering
[src]
&self,
a: &dyn SelectableNode<T>,
b: &dyn SelectableNode<T>
) -> Ordering