Struct dogs::tree_search::algo::greedy_pe::PEGreedy

pub struct PEGreedy<N, B, G, Tree> {
    pub manager: SearchManager<N, B>,
    // some fields omitted
}

implements a partial expansion greedy algorithm

Fields

manager: SearchManager<N, B>

search manager

Implementations

impl<N: Clone, B: PartialOrd + Copy, G, Tree> PEGreedy<N, B, G, Tree>

pub fn new(tree: Rc<RefCell<Tree>>) -> Self

builds the partial expansion greedy using the search space

Trait Implementations

impl<N: Debug, B: Debug, G: Debug, Tree: Debug> Debug for PEGreedy<N, B, G, Tree>

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

Formats the value using the given formatter.

impl<'a, N, B, G: Ord + Clone, Tree> SearchAlgorithm<N, B> for PEGreedy<N, B, G, Tree> where
    N: Clone,
    B: PartialOrd + Copy,
    Tree: SearchSpace<N, B> + GuidedSpace<N, G> + PartialNeighborGeneration<N>, 

fn is_optimal(&self) -> bool

returns true if the optimal value is found (thus we can stop the search). For this greedy, we set it to always false (it is not destined to prove optimality)

fn run<SC: StoppingCriterion>(&mut self, stopping_criterion: SC) where
    SC: StoppingCriterion, 

runs until the stopping_criterion is reached

fn get_manager(&mut self) -> &mut SearchManager<N, B>

Gets the search manager of the algorithm. It allows to get the best found solution and its value, etc.

fn json_statistics(&self, json: &mut Value)

provides various statistics of events that occured during the search.