public class NumberedDFSDiscoverTimeIterator<T> extends DFSDiscoverTimeIterator<T> implements Iterator<T>
Modifier and Type | Field and Description |
---|---|
protected NumberedGraph<T> |
G
The Graph being traversed
|
capacityIncrement, elementCount, elementData
modCount
Constructor and Description |
---|
NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G)
Constructor DFSFinishTimeIterator.
|
NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G,
Iterator<? extends T> nodes)
Construct a depth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given
enumeration.
|
NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G,
T N)
Construct a depth-first enumerator starting with a particular node in a directed graph.
|
Modifier and Type | Method and Description |
---|---|
protected Iterator<? extends T> |
getConnected(T n)
get the out edges of a given node
|
protected Iterator<? extends T> |
getPendingChildren(T n)
Method getPendingChildren.
|
protected void |
init(Graph<T> G,
Iterator<? extends T> nodes) |
protected void |
setPendingChildren(T v,
Iterator<? extends T> iterator)
Method setPendingChildren.
|
hasNext, init, init, next, remove, visitEdge
add, add, addAll, addAll, addElement, capacity, clear, clone, contains, containsAll, copyInto, elementAt, elements, ensureCapacity, equals, firstElement, forEach, get, hashCode, indexOf, indexOf, insertElementAt, isEmpty, iterator, lastElement, lastIndexOf, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeAllElements, removeElement, removeElementAt, removeIf, removeRange, replaceAll, retainAll, set, setElementAt, setSize, size, sort, spliterator, subList, toArray, toArray, toString, trimToSize
finalize, getClass, notify, notifyAll, wait, wait, wait
forEachRemaining, hasNext, next, remove
parallelStream, stream
protected final NumberedGraph<T> G
public NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G, T N)
G
- the graph whose nodes to enumerateIllegalArgumentException
- if G is nullpublic NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G, Iterator<? extends T> nodes) throws IllegalArgumentException
G
- the graph whose nodes to enumeratenodes
- the set of nodes from which to start searchingIllegalArgumentException
- if G is nullIllegalArgumentException
- if nodes == nullpublic NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G) throws NullPointerException
G
- NullPointerException
- if G is nullprotected Iterator<? extends T> getPendingChildren(T n)
getPendingChildren
in class DFSDiscoverTimeIterator<T>
protected void setPendingChildren(T v, Iterator<? extends T> iterator)
setPendingChildren
in class DFSDiscoverTimeIterator<T>
v
- iterator
- protected Iterator<? extends T> getConnected(T n)
DFSDiscoverTimeIterator
getConnected
in class DFSDiscoverTimeIterator<T>
n
- the node of which to get the out edges