Class NumberedDFSFinishTimeIterator<T>
java.lang.Object
java.util.AbstractCollection<T>
java.util.AbstractList<T>
java.util.ArrayList<T>
com.ibm.wala.util.graph.traverse.DFSFinishTimeIterator<T>
com.ibm.wala.util.graph.traverse.NumberedDFSFinishTimeIterator<T>
- All Implemented Interfaces:
Serializable, Cloneable, Iterable<T>, Collection<T>, Iterator<T>, List<T>, RandomAccess, SequencedCollection<T>
This class implements depth-first search over a NumberedGraph, return an enumeration of the nodes
of the graph in order of increasing discover time. This class follows the outNodes of the graph
nodes to define the graph, but this behavior can be changed by overriding the getConnected
method.
- See Also:
-
Field Summary
Fields inherited from class AbstractList
modCount -
Method Summary
Methods inherited from class DFSFinishTimeIterator
getConnected, hasNext, init, next, removeMethods inherited from class ArrayList
add, add, addAll, addAll, addFirst, addLast, clear, clone, contains, ensureCapacity, equals, forEach, get, getFirst, getLast, hashCode, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeFirst, removeIf, removeLast, removeRange, replaceAll, retainAll, set, size, sort, spliterator, subList, toArray, toArray, trimToSizeMethods inherited from class AbstractCollection
containsAll, toStringMethods inherited from interface Collection
parallelStream, stream, toArrayMethods inherited from interface Iterator
forEachRemainingMethods inherited from interface List
containsAll, reversed