Package | Description |
---|---|
org.encog.neural.hyperneat | |
org.encog.neural.neat | |
org.encog.neural.neat.training | |
org.encog.neural.neat.training.opp |
Modifier and Type | Method and Description |
---|---|
NEATGenome |
FactorHyperNEATGenome.factor(List<NEATNeuronGene> neurons,
List<NEATLinkGene> links,
int inputCount,
int outputCount)
Create a NEAT genome from a list of links and neurons.
|
Constructor and Description |
---|
HyperNEATGenome(List<NEATNeuronGene> neurons,
List<NEATLinkGene> links,
int inputCount,
int outputCount)
Construct a HyperNEAT genome from a list of neurons and links.
|
Modifier and Type | Method and Description |
---|---|
NEATGenome |
FactorNEATGenome.factor(List<NEATNeuronGene> neurons,
List<NEATLinkGene> links,
int inputCount,
int outputCount)
Create a NEAT genome from a list of links and neurons.
|
NEATGenome |
NEATGenomeFactory.factor(List<NEATNeuronGene> neurons,
List<NEATLinkGene> links,
int inputCount,
int outputCount)
Create a NEAT genome from a list of links and neurons.
|
Modifier and Type | Method and Description |
---|---|
NEATNeuronGene |
NEATGenome.findNeuron(long nodeID)
Find the neuron with the specified nodeID.
|
Modifier and Type | Method and Description |
---|---|
List<NEATNeuronGene> |
NEATGenome.getNeuronsChromosome() |
Modifier and Type | Method and Description |
---|---|
void |
NEATNeuronGene.copy(NEATNeuronGene gene)
Copy another gene to this one.
|
Constructor and Description |
---|
NEATNeuronGene(NEATNeuronGene other)
Construct this gene by comping another.
|
Constructor and Description |
---|
NEATGenome(List<NEATNeuronGene> neurons,
List<NEATLinkGene> links,
int inputCount,
int outputCount)
Create a NEAT gnome.
|
Modifier and Type | Method and Description |
---|---|
NEATNeuronGene |
NEATMutation.chooseRandomNeuron(NEATGenome target,
boolean choosingFrom)
Choose a random neuron.
|
Modifier and Type | Method and Description |
---|---|
void |
NEATCrossover.addNeuronID(long nodeID,
List<NEATNeuronGene> vec,
NEATGenome best,
NEATGenome notBest)
Add a neuron.
|
Copyright © 2014. All Rights Reserved.