Struct petri::algo::Simple

pub struct Simple<G: Genome<C>, C: Clone + Sized, SOp: SelectOperator<G, C, O>, COp: CrossoverOperator<G, C>, MOp: MutateOperator<G, C>, EOp: Fn(&G) -> O, R: Rng, O: Ord + Clone> { /* fields omitted */ }

Methods

impl<G: Genome<C>, C: Clone + Sized, SOp: SelectOperator<G, C, O>, COp: CrossoverOperator<G, C>, MOp: MutateOperator<G, C>, EOp: Fn(&G) -> O, R: Rng, O: Ord + Clone> Simple<G, C, SOp, COp, MOp, EOp, R, O>

fn new(
    select_op: SOp,
    crossover_op: COp,
    mutate_op: MOp,
    evaluate_op: EOp,
    mut_pb: f32,
    cx_pb: f32,
    max_generation: usize,
    rng: R
) -> Self

Trait Implementations

impl<G: Debug + Genome<C>, C: Debug + Clone + Sized, SOp: Debug + SelectOperator<G, C, O>, COp: Debug + CrossoverOperator<G, C>, MOp: Debug + MutateOperator<G, C>, EOp: Debug + Fn(&G) -> O, R: Debug + Rng, O: Debug + Ord + Clone> Debug for Simple<G, C, SOp, COp, MOp, EOp, R, O>

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

Formats the value using the given formatter.

impl<G: Genome<C>, C: Clone + Sized, SOp: SelectOperator<G, C, O>, COp: CrossoverOperator<G, C>, MOp: MutateOperator<G, C>, EOp: Fn(&G) -> O, R: Rng, O: Ord + Clone> EvolutionaryAlgorithm<G, C, SOp, COp, MOp, EOp, R, O> for Simple<G, C, SOp, COp, MOp, EOp, R, O>

fn initialize(&mut self, n: usize, init_fn: fn() -> G)

Initialize the algorithm by generating a population

fn next(&mut self) -> Vec<G>

Advance to next generation

fn population(&self) -> Vec<G>

Current generation

fn is_done(&self) -> bool

Is the evolutationary algorithm done?