Package com.ibm.wala.util.graph.traverse
Class DFSDiscoverTimeIterator<T>
java.lang.Object
java.util.AbstractCollection<E>
java.util.AbstractList<E>
java.util.ArrayList<T>
com.ibm.wala.util.graph.traverse.DFSDiscoverTimeIterator<T>
- All Implemented Interfaces:
Serializable
,Cloneable
,Iterable<T>
,Collection<T>
,Iterator<T>
,List<T>
,RandomAccess
- Direct Known Subclasses:
NumberedDFSDiscoverTimeIterator
,SlowDFSDiscoverTimeIterator
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 java.util.AbstractList
modCount
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptiongetConnected
(T n) get the out edges of a given nodeboolean
hasNext()
Return whether there are any more nodes left to enumerate.protected void
subclass constructors must call this!protected void
subclass constructors must call this!next()
Find the next graph node in discover time order.void
remove()
protected abstract void
setPendingChildren
(T v, Iterator<? extends T> iterator) protected void
Methods inherited from class java.util.ArrayList
add, add, addAll, addAll, clear, clone, contains, ensureCapacity, equals, forEach, get, hashCode, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeIf, removeRange, replaceAll, retainAll, set, size, sort, spliterator, subList, toArray, toArray, trimToSize
Methods inherited from class java.util.AbstractCollection
containsAll, toString
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.util.Collection
parallelStream, stream, toArray
Methods inherited from interface java.util.Iterator
forEachRemaining
Methods inherited from interface java.util.List
containsAll
-
Constructor Details
-
DFSDiscoverTimeIterator
public DFSDiscoverTimeIterator()
-
-
Method Details
-
init
subclass constructors must call this! -
init
subclass constructors must call this! -
hasNext
public boolean hasNext()Return whether there are any more nodes left to enumerate. -
getPendingChildren
-
setPendingChildren
-
next
Find the next graph node in discover time order.- Specified by:
next
in interfaceIterator<T>
- Returns:
- the next graph node in discover time order.
- Throws:
NoSuchElementException
-
getConnected
get the out edges of a given node- Parameters:
n
- the node of which to get the out edges- Returns:
- the out edges
-
remove
- Specified by:
remove
in interfaceIterator<T>
- Throws:
UnimplementedError
-
visitEdge
- Parameters:
from
- source of the edge to visitto
- target of the edge to visit
-