public class SlowDFSFinishTimeIterator<T> extends DFSFinishTimeIterator<T>
Modifier and Type | Field and Description |
---|---|
static long |
serialVersionUID |
capacityIncrement, elementCount, elementData
modCount
Constructor and Description |
---|
SlowDFSFinishTimeIterator(Graph<T> G) |
SlowDFSFinishTimeIterator(Graph<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.
|
SlowDFSFinishTimeIterator(Graph<T> G,
T N)
Construct a depth-first enumerator starting with a particular node in a directed graph.
|
getConnected, hasNext, init, next, remove
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
parallelStream, stream
public static final long serialVersionUID
public SlowDFSFinishTimeIterator(Graph<T> G, T N) throws IllegalArgumentException
G
- the graph whose nodes to enumerateIllegalArgumentException
- if G is nullpublic SlowDFSFinishTimeIterator(Graph<T> G, Iterator<? extends T> nodes)
G
- the graph whose nodes to enumeratenodes
- the set of nodes from which to start searchingpublic SlowDFSFinishTimeIterator(Graph<T> G) throws NullPointerException
NullPointerException
- if G is null