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:
java.io.Serializable
,java.lang.Cloneable
,java.lang.Iterable<T>
,java.util.Collection<T>
,java.util.Iterator<T>
,java.util.List<T>
,java.util.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 long
serialVersionUID
-
Constructor Summary
Constructors Constructor Description SlowDFSFinishTimeIterator(Graph<T> G)
SlowDFSFinishTimeIterator(Graph<T> G, java.util.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
-
-
-
-
Field Detail
-
serialVersionUID
public static final long serialVersionUID
- See Also:
- Constant Field Values
-
-
Constructor Detail
-
SlowDFSFinishTimeIterator
public SlowDFSFinishTimeIterator(Graph<T> G, T N) throws java.lang.IllegalArgumentException
Construct a depth-first enumerator starting with a particular node in a directed graph.- Parameters:
G
- the graph whose nodes to enumerate- Throws:
java.lang.IllegalArgumentException
- if G is null
-
SlowDFSFinishTimeIterator
public SlowDFSFinishTimeIterator(Graph<T> G, java.util.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 enumeratenodes
- the set of nodes from which to start searching
-
-