public class PostOrderTraverser extends Object implements Traverser
Traverser
for a
Graph
, with no cycle detection. The last node
returned is the start node, and no Edge
is traversed
to reach it. All of the caveats concerning the ordering of the
operations hasNext()
, next()
, and
remove()
detailed by the Traverser
class
documentation apply here.Constructor and Description |
---|
PostOrderTraverser(Object startNode,
Graph graph,
org.apache.commons.collections.Predicate traverserPredicate)
Creates a new
PostOrderTraverser . |
PostOrderTraverser(Object startNode,
Graph graph,
org.apache.commons.collections.Transformer traverserFactory)
Creates a new
PostOrderTraverser . |
PostOrderTraverser(Object startNode,
OrientedForest forest)
Creates a new
PostOrderTraverser , which
depth-first traverses the descendants of the specified
startNode . |
PostOrderTraverser(Object startNode,
org.apache.commons.collections.Transformer traverserFactory)
Creates a new
PostOrderTraverser . |
Modifier and Type | Method and Description |
---|---|
Graph.Edge |
getEdge()
Returns the
Edge which was traversed to get to
the last node returned by next() , or
null if no Edge was traversed. |
boolean |
hasNext() |
Object |
next() |
void |
remove() |
void |
removeEdge()
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
forEachRemaining
public PostOrderTraverser(Object startNode, Graph graph, org.apache.commons.collections.Predicate traverserPredicate)
PostOrderTraverser
.public PostOrderTraverser(Object startNode, OrientedForest forest)
PostOrderTraverser
, which
depth-first traverses the descendants of the specified
startNode
. The specified startNode
cannot be removed by remove()
when using this
constructor.public PostOrderTraverser(Object startNode, org.apache.commons.collections.Transformer traverserFactory)
PostOrderTraverser
. The specified
startNode
cannot be removed by remove()
when using this constructor.public Graph.Edge getEdge()
Traverser
Edge
which was traversed to get to
the last node returned by next()
, or
null
if no Edge
was traversed. This
call can be made only if remove()
or removeEdge()
has not been called after the last
call to next()
.public void removeEdge()
Traverser
Graph
the
Edge
that would be returned by getEdge()
(optional operation). If no Edge
was
traversed (as in the root of a breadth-first search), this
method throws a IllegalStateException
. This
method can be called only once per call to next()
. The behavior of a traverser is unspecified if the
underlying graph structure is modified while the traversal is
in progress in any way other than by calling this method or
remove()
.removeEdge
in interface Traverser
See the Plexus project home, hosted by SourceForge.
Copyright ? 1994-2006, by Phoenix Software Technologists, Inc. and others. All Rights Reserved. Use is subject to license terms.