public class SlowDFSDiscoverTimeIterator<T> extends DFSDiscoverTimeIterator<T> implements Iterator<T>
Modifier and Type | Field and Description |
---|---|
static long |
serialVersionUID |
capacityIncrement, elementCount, elementData
modCount
Modifier | Constructor and Description |
---|---|
protected |
SlowDFSDiscoverTimeIterator()
For use with extreme care by subclasses that know what they're doing.
|
|
SlowDFSDiscoverTimeIterator(Graph<T> G)
Constructor SlowDFSDiscoverTimeIterator.
|
|
SlowDFSDiscoverTimeIterator(Graph<T> G,
Iterator<T> nodes)
Construct a depth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given
enumeration.
|
|
SlowDFSDiscoverTimeIterator(Graph<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(Object n) |
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
public static final long serialVersionUID
protected SlowDFSDiscoverTimeIterator()
public SlowDFSDiscoverTimeIterator(Graph<T> G, T N)
G
- the graph whose nodes to enumeratepublic SlowDFSDiscoverTimeIterator(Graph<T> G, Iterator<T> nodes)
G
- the graph whose nodes to enumeratenodes
- the set of nodes from which to start searchingpublic SlowDFSDiscoverTimeIterator(Graph<T> G) throws NullPointerException
G
- NullPointerException
- if G is nullprotected Iterator<? extends T> getPendingChildren(Object 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