Package com.ibm.wala.util.graph.traverse

Class SlowDFSFinishTimeIterator<T>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractList<E>

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

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

Modifier and Type	Field	Description
static final long	serialVersionUID

Fields inherited from class java.util.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 com.ibm.wala.util.graph.traverse.DFSFinishTimeIterator

getConnected, hasNext, init, next, remove

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

Field Details

serialVersionUID

public static final long serialVersionUID

See Also:

• Constant Field Values

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