Class NumberedDFSDiscoverTimeIterator<T>

java.lang.Object

java.util.AbstractCollection<T>

java.util.AbstractList<T>

java.util.ArrayList<T>

com.ibm.wala.util.graph.traverse.DFSDiscoverTimeIterator<T>

com.ibm.wala.util.graph.traverse.NumberedDFSDiscoverTimeIterator<T>

All Implemented Interfaces:

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

public class NumberedDFSDiscoverTimeIterator<T>
extends DFSDiscoverTimeIterator<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:

• Serialized Form

Field Summary

Fields

Modifier and Type	Field	Description
protected final NumberedGraph<T>	G	The Graph being traversed

Fields inherited from class AbstractList

modCount

Constructor Summary

Constructors

Constructor	Description
NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G)	Constructor DFSFinishTimeIterator.
NumberedDFSDiscoverTimeIterator(NumberedGraph<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.
NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G, T N)	Construct a depth-first enumerator starting with a particular node in a directed graph.

Method Summary

Modifier and Type	Method	Description
protected Iterator<? extends T>	getConnected(T n)	get the out edges of a given node
protected Iterator<? extends T>	getPendingChildren(T n)	Method getPendingChildren.
protected void	init(Graph<T> G, Iterator<? extends T> nodes)
protected void	setPendingChildren(T v, Iterator<? extends T> iterator)	Method setPendingChildren.

Methods inherited from class DFSDiscoverTimeIterator

hasNext, init, init, next, remove, visitEdge

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

Field Details

G

protected final NumberedGraph<T> G

The Graph being traversed

Constructor Details

NumberedDFSDiscoverTimeIterator

public NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G,
 T N)

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

NumberedDFSDiscoverTimeIterator

public NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G,
 @Nullable Iterator<? extends T> nodes)
                                throws IllegalArgumentException

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

Throws:

IllegalArgumentException - if G is null

IllegalArgumentException - if nodes == null

NumberedDFSDiscoverTimeIterator

public NumberedDFSDiscoverTimeIterator(NumberedGraph<T> G)
                                throws NullPointerException

Constructor DFSFinishTimeIterator.

Throws:

NullPointerException - if G is null

Method Details

getPendingChildren

protected Iterator<? extends T> getPendingChildren(T n)

Method getPendingChildren.

Specified by:

getPendingChildren in class DFSDiscoverTimeIterator<T>

Returns:

Object

setPendingChildren

protected void setPendingChildren(T v,
 Iterator<? extends T> iterator)

Method setPendingChildren.

Specified by:

setPendingChildren in class DFSDiscoverTimeIterator<T>

init

protected void init(Graph<T> G,
 Iterator<? extends T> nodes)

getConnected

protected Iterator<? extends T> getConnected(T n)

Description copied from class: DFSDiscoverTimeIterator

get the out edges of a given node

Specified by:

getConnected in class DFSDiscoverTimeIterator<T>

Parameters:

n - the node of which to get the out edges

Returns:

the out edges