|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object jpaul.Graphs.LDiGraph.LForwardNavigator<Vertex,Label>
public abstract static class LDiGraph.LForwardNavigator<Vertex,Label>
Forward iterator into a labeled graph. Each labeled navigator is also a normal navigator: we just strip the labels off the arcs.
Constructor Summary | |
---|---|
LDiGraph.LForwardNavigator()
|
Method Summary | |
---|---|
abstract java.util.List<Pair<Vertex,Label>> |
lnext(Vertex v)
Returns the list of the arcs that exit vertex v . |
java.util.List<Vertex> |
next(Vertex v)
Returns the successors of vertex . |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public LDiGraph.LForwardNavigator()
Method Detail |
---|
public abstract java.util.List<Pair<Vertex,Label>> lnext(Vertex v)
v
. Each arc is modeled as a pair of the
destination vertex and the arc label.
public java.util.List<Vertex> next(Vertex v)
ForwardNavigator
vertex
.
next
in interface ForwardNavigator<Vertex>
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |