ecj 26 API

Packages

Package	Description
ec
ec.app.ant
ec.app.ant.func
ec.app.bbob
ec.app.cartpole
ec.app.coevolve1
ec.app.coevolve2
ec.app.ecsuite
ec.app.edge
ec.app.edge.func
ec.app.gpsemantics
ec.app.gpsemantics.func
ec.app.gui
ec.app.hiff
ec.app.highdimension
ec.app.klandscapes
ec.app.klandscapes.func
ec.app.knapsack	Implementation of the basic knapsack problem, with examples of combinatorial optimization algorithms that solve it.
ec.app.lawnmower
ec.app.lawnmower.func
ec.app.lid
ec.app.lid.func
ec.app.majority
ec.app.majority.func
ec.app.mona
ec.app.moosuite
ec.app.multiplexer
ec.app.multiplexer.func
ec.app.multiplexerslow
ec.app.multiplexerslow.func
ec.app.nk
ec.app.ordertree
ec.app.ordertree.func
ec.app.parity
ec.app.parity.func
ec.app.push
ec.app.regression
ec.app.regression.func
ec.app.royaltree
ec.app.royaltree.func
ec.app.sat
ec.app.singular
ec.app.sum
ec.app.tsp	Example application to Traveling Salesman problem instances.
ec.app.tutorial1
ec.app.tutorial2
ec.app.tutorial3
ec.app.tutorial4
ec.app.twobox
ec.app.twobox.func
ec.app.xor
ec.breed
ec.co	The ec.co package contains combinatorial optimization (CO) algorithms and the components necessary to build them.
ec.co.ant	Ant Colony Optimization algorithms This package contains the components necessary to implement ACO algorithms, specifically the classic pair: Ant System and Ant Colony System.
ec.co.grasp
ec.coevolve
ec.de
ec.display
ec.display.chart
ec.display.portrayal
ec.eda.amalgam
ec.eda.cmaes
ec.eda.dovs
ec.eda.pbil
ec.es
ec.eval
ec.evolve
ec.exchange
ec.gp
ec.gp.breed
ec.gp.build
ec.gp.ge
ec.gp.ge.breed
ec.gp.koza
ec.gp.push
ec.multiobjective
ec.multiobjective.nsga2
ec.multiobjective.nsga3
ec.multiobjective.spea2
ec.neat
ec.parsimony
ec.pso
ec.rule
ec.rule.breed
ec.select
ec.simple
ec.singlestate
ec.spatial
ec.steadystate
ec.util
ec.vector
ec.vector.breed