private final class Traverser.GraphTraverser.DepthFirstIterator extends AbstractIterator<N>
| Modifier and Type | Class and Description |
|---|---|
private class |
Traverser.GraphTraverser.DepthFirstIterator.NodeAndSuccessors
A simple tuple of a node and a partially iterated
Iterator of its successors. |
| Modifier and Type | Field and Description |
|---|---|
private Traverser.Order |
order |
private java.util.Deque<Traverser.GraphTraverser.DepthFirstIterator.NodeAndSuccessors> |
stack |
private java.util.Set<N> |
visited |
| Constructor and Description |
|---|
DepthFirstIterator(java.lang.Iterable<? extends N> roots,
Traverser.Order order) |
| Modifier and Type | Method and Description |
|---|---|
protected N |
computeNext()
Returns the next element.
|
(package private) Traverser.GraphTraverser.DepthFirstIterator.NodeAndSuccessors |
withSuccessors(N node) |
endOfData, hasNext, next, peekremoveprivate final java.util.Deque<Traverser.GraphTraverser.DepthFirstIterator.NodeAndSuccessors> stack
private final java.util.Set<N> visited
private final Traverser.Order order
DepthFirstIterator(java.lang.Iterable<? extends N> roots, Traverser.Order order)
protected N computeNext()
AbstractIteratorAbstractIterator.endOfData() when
there are no elements left in the iteration. Failure to do so could result in an infinite loop.
The initial invocation of AbstractIterator.hasNext() or AbstractIterator.next() calls this method, as does
the first invocation of hasNext or next following each successful call to
next. Once the implementation either invokes endOfData or throws an exception,
computeNext is guaranteed to never be called again.
If this method throws an exception, it will propagate outward to the hasNext or
next invocation that invoked this method. Any further attempts to use the iterator will
result in an IllegalStateException.
The implementation of this method may not invoke the hasNext, next, or
AbstractIterator.peek() methods on this instance; if it does, an IllegalStateException will
result.
computeNext in class AbstractIterator<N>endOfData was called during execution,
the return value will be ignored.Traverser.GraphTraverser.DepthFirstIterator.NodeAndSuccessors withSuccessors(N node)