|
JavaGenes, NASA Ames. Written largely by Al Globus | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectgov.nasa.javaGenes.graph.VertexAndTrailIterator
This iterator will return each vertex in g starting with the neighbors of v using a breadth first search. Along with each vertex will be the shortest trail to it from v. In cases where there are more than one shortest trail to a vertex, that vertex will be returned once for each shortest trail along with the appropriate trail.
Graph
,
Trail
Constructor Summary | |
VertexAndTrailIterator(Graph g,
Vertex v)
|
Method Summary | |
boolean |
more()
|
void |
next()
move to the next trail |
Trail |
trail()
|
Vertex |
vertex()
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public VertexAndTrailIterator(Graph g, Vertex v)
g
- the graph to find trails inv
- the vertex to start from (starts every trail)Method Detail |
public boolean more()
public void next()
public Vertex vertex()
public Trail trail()
|
JavaGenes, NASA Ames. Written largely by Al Globus | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |