Abstract Data Types


EO class
EOAlgo
Algorithm that performs the evolutionary computation Might be genetic or not
EOBase
Base class for chromosomes, it's a very basic class, which does not require anything but a fitness and an ID
SortEO
sort class for EOBase
EOBidim
Bidimensional Chromosomes
template < class T, class fitT> ostream& operator<<( ostream& os, const EOBidim<T, fitT> & chrom )
EOBidimEvaluator
Evaluator takes a vector of EOs and evaluates its fitness returning void
EOEvalFunc
Evaluate: takes one EO and sets its "fitness" property returning this fitness also
EOFactory
EO Factory
Fitness
Genetic operators
EOPop
Subpopulation: it is used to move parts of population from one algorithm to another and one population to another
EOReplace
Abstract data type for Replacement algorithms, which will be implemented elsewhere
Selection and reproduction algorithms
EOTerm
Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination
urEO
Base class for chromosomes, it's a very basic class, which does not require anything but a fitness and an ID; and it know how to evaluate fitness itself
Abstract data types are the foundation of the EO library. They provide the interface that objects have to follow to be able to interact with the other objects in the EO library. EO ADTs are usually defined by the EO coordination; theoretically, you shouldn´t need to define new ones. But if you do, tell us.

alphabetic index hierarchy of classes


BinOp