In file EO++.h:

template <class EOT> class EOEasyGA : public EOAlgo<EOT>

Simple algorithm for evolutionary computation It is not exactly a Simple GA, as defined by Goldberg, it is just a simple implementation of a Genetic Algorithm

Inheritance:


Public Methods

virtual void operator ()( EOPop<EOT>& _pop )
Run the algorithm
EOEasyGA( EOEvaluator<EOT>& _eval, EOSelector< EOT>& _select, EOBreeder<EOT>& _breed, EOTerm<EOT>& _term, EOReplace<EOT>& _rep, bool _verbose = false )
The ctor takes all necessary object for an evolutionary algorithm as pointers
virtual ~EOEasyGA()
Ctor must ve virtual

Private Fields

bool verbose
Indicates if it is going to be "verbose": print all things, and so on

Inherited from EOAlgo:

Public Methods

virtual void operator) ( EOPop<EOT>& _pop )

Documentation

Simple algorithm for evolutionary computation It is not exactly a Simple GA, as defined by Goldberg, it is just a simple implementation of a Genetic Algorithm
EOEasyGA( EOEvaluator<EOT>& _eval, EOSelector< EOT>& _select, EOBreeder<EOT>& _breed, EOTerm<EOT>& _term, EOReplace<EOT>& _rep, bool _verbose = false )
The ctor takes all necessary object for an evolutionary algorithm as pointers. These are used so that they can have default null values Initial population can also be passed on. If not, it has to be generated randomly

virtual ~EOEasyGA()
Ctor must ve virtual

virtual void operator ()( EOPop<EOT>& _pop )
Run the algorithm

bool verbose
Indicates if it is going to be "verbose": print all things, and so on


This class has no child classes.

alphabetic index hierarchy of classes


BinOp