| Package | Description |
|---|---|
| ec.app.gpsemantics | |
| ec.gp | |
| ec.gp.breed | |
| ec.gp.ge | |
| ec.gp.koza |
| Modifier and Type | Method and Description |
|---|---|
(package private) ArrayList |
Semantic.getSemanticOutput(GPTree t) |
| Modifier and Type | Field and Description |
|---|---|
GPTree[] |
GPIndividual.trees |
| Modifier and Type | Method and Description |
|---|---|
GPTree |
GPTree.lightClone()
Like clone() but doesn't copy the tree.
|
| Modifier and Type | Method and Description |
|---|---|
GPNode |
GPNodeSelector.pickNode(EvolutionState s,
int subpopulation,
int thread,
GPIndividual ind,
GPTree tree)
Picks a node at random from tree and returns it.
|
boolean |
GPTree.treeEquals(GPTree tree)
Returns true if I am "genetically" the same as tree,
though we may have different owners.
|
| Modifier and Type | Method and Description |
|---|---|
protected GPNode |
SizeFairCrossoverPipeline.findFairSizeNode(ArrayList nodeToSubtrees,
HashMap sizeToNodes,
GPNode parent1SelectedNode,
GPTree tree2,
EvolutionState state,
int thread)
This method finds a node using the logic given in the langdon paper.
|
| Modifier and Type | Method and Description |
|---|---|
List |
GESpecies.flattenSexp(EvolutionState state,
int threadnum,
GPTree tree)
Flattens an S-expression
|
int |
GESpecies.makeTree(EvolutionState state,
int[] genome,
GPTree tree,
int position,
int treeNum,
int threadnum,
HashMap ercMapsForFancyPrint)
makeTree, edits the tree that its given by adding a root (and all subtrees attached)
|
int |
GESpecies.makeTrees(EvolutionState state,
GEIndividual ind,
GPTree[] trees,
int threadnum,
HashMap ercMapsForFancyPrint)
creates all of an individual's trees
|
int |
GESpecies.makeTrees(EvolutionState state,
int[] genome,
GPTree[] trees,
int threadnum,
HashMap ercMapsForFancyPrint) |
| Modifier and Type | Method and Description |
|---|---|
GPNode |
KozaNodeSelector.pickNode(EvolutionState s,
int subpopulation,
int thread,
GPIndividual ind,
GPTree tree) |
Copyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.