JavaGenes, NASA Ames. Written largely by Al Globus

Package gov.nasa.javaGenes.graph

Class Summary
AcceptableSecondBrokenEdge The execute() method will determine whether a BrokenEdge may be merged with the BrokenEdge argument to the constructor.
AcceptableSecondVertex Used to find a vertex to make an edge to.
AddDirectedEdge Mutation operator to add a DirectedEdge between two DirectedVertex in a DirectedGraph.
AddDirectedVertex Mutation operator to add a DirectedVertex by a DirectedEdge to a random vertex in a DirectedGraph.
AddEdge Mutation operator to add an Edge between two Vertex in a Graph.
AddVertex Mutation operator to add a Vertex by an Edge to a random vertex in a Graph.
apsp All-pairs-shortest-path algorithm and supporting functions for graphs.
BrokenEdge When an edge is cut during crossover, this class is used to remember the cut edge and the vertex it is associated with.
BrokenGraph Two of these classes are used to represent the sub-graphs produced when ripping a graph in half during crossover.
CyclesSimilarity fitness function that compares the number of cycles in an individual with the number of cycles in a target using the Tanimoto coefficient.
DirectedEdge  
DirectedGraph  
DirectedVertex  
DissimilarEdgeCompatibleWithVertices  
Edge Edges in Graphs.
EdgeIterator serves as an iterator for a vector of Edge objects
ExtendedTypeSimilarity a fitness function consisting of the Tanimoto distance to a target.
Graph A information theoretic graph, in other words, a set of vertices and a set of edges.
Graph.TrailKey An object that efficiently represents a path for use in as a key Hashtables and KeyCounters.
GraphElement Superclass for parts of a graph.
GraphGenerator  
GraphIndividual Represents a genetic software graph individual.
GraphLayout this class is an interface to the jiggle package that does graph layout for viewing.
GraphParameters Parameters and setup for genetic graph runs.
GraphPopulation Represents a population of evolvable Graph objects
GraphTest  
HasInputEdgeFrom  
HasOutputEdgesTo  
MutateEdge mutate an edge
MutateVertex mutate a vertex
Trail A trail of edges between ends[0] and ends[1].
TwoVertexGraphCrossover implements the crossover operator described in "JavaGenes: Evolving Graphs with Crossover," Al Globus, Sean Atsatt, John Lawton, and Todd Wipke and found at http://www.nas.nasa.gov/~globus/papers/JavaGenes/paper.html
Vertex a vertex in a graph.
VertexAcceptsEdge predicate that determines when vertices can accept an additional edge
VertexAcceptsInputEdge predicate that determines when vertices can accept an input edge.
VertexAcceptsOutputEdge predicate that determines when vertices can accept an output edge.
VertexAndEdgeProvider holds a set of vertices and a set of edges.
VertexAndTrailIterator This iterator will return each vertex in g starting with the neighbors of v using a breadth first search.
VertexIterator iterate over a Vector containing Vertex objects
VertexPairsDistanceSimilarity fitness is the distance from a target graph.
VertexTest  
 


JavaGenes, NASA Ames. Written largely by Al Globus