Class SlowDFSFinishTimeIterator<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.SlowDFSFinishTimeIterator<T>

All Implemented Interfaces:

Serializable, Cloneable, Iterable<T>, Collection<T>, Iterator<T>, List<T>, RandomAccess, SequencedCollection<T>

public class SlowDFSFinishTimeIterator<T>
extends DFSFinishTimeIterator<T>

This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing finishing 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:

• Serialized Form

Field Summary

Fields inherited from class AbstractList

modCount

Constructor Summary

Constructors

Constructor	Description
SlowDFSFinishTimeIterator(Graph<T> G)
SlowDFSFinishTimeIterator(Graph<T> G, @Nullable 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.

Method Summary

Methods inherited from class DFSFinishTimeIterator

getConnected, hasNext, init, next, remove

Methods 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, trimToSize

Methods inherited from class AbstractCollection

containsAll, toString

Methods inherited from class Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface Collection

parallelStream, stream, toArray

Methods inherited from interface Iterator

forEachRemaining

Methods inherited from interface List

containsAll, reversed

Constructor Details

SlowDFSFinishTimeIterator

public SlowDFSFinishTimeIterator(Graph<T> G,
 T N)
                          throws IllegalArgumentException

Construct a depth-first enumerator starting with a particular node in a directed graph.

Parameters:

G - the graph whose nodes to enumerate

Throws:

IllegalArgumentException - if G is null

SlowDFSFinishTimeIterator

public SlowDFSFinishTimeIterator(Graph<T> G,
 @Nullable Iterator<? extends T> nodes)

Construct a depth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given enumeration.

Parameters:

G - the graph whose nodes to enumerate

nodes - the set of nodes from which to start searching

SlowDFSFinishTimeIterator

public SlowDFSFinishTimeIterator(Graph<T> G)
                          throws NullPointerException

Throws:

NullPointerException - if G is null