Struct dogs::tree_search::algo::beam_search_dom::BeamSearchDom

pub struct BeamSearchDom<N, B, G, Space> { /* fields omitted */ }

beam search with pareto-dominance scheme

Implementations

impl<Space, N: Clone, B: PartialOrd + Copy, G: Ord> BeamSearchDom<N, B, G, Space>

pub fn new(
    space: Rc<RefCell<Space>>,
    d: usize,
    dom_scheme: BeamDominanceScheme
) -> Self

builds the beam search using the search space, the beam width, and the dominance scheme

Trait Implementations

impl<N: Debug, B: Debug, G: Debug, Space: Debug> Debug for BeamSearchDom<N, B, G, Space>

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

Formats the value using the given formatter.

impl<'a, N, B, G, Space> SearchAlgorithm<N, B> for BeamSearchDom<N, B, G, Space> where
    N: Clone,
    B: PartialOrd + Copy,
    G: Ord + Clone,
    Space: SearchSpace<N, B> + GuidedSpace<N, G> + TotalNeighborGeneration<N> + ParetoDominanceSpace<N>, 

fn is_optimal(&self) -> bool

returns true if the optimal value is found (thus we can stop the search)

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

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.