Class DFSFinishTimeIterator<T>

java.lang.Object

java.util.AbstractCollection<T>

java.util.AbstractList<T>

java.util.ArrayList<T>

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

All Implemented Interfaces:

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

Direct Known Subclasses:

NumberedDFSFinishTimeIterator, SlowDFSFinishTimeIterator

public abstract class DFSFinishTimeIterator<T>
extends ArrayList<T>
implements Iterator<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 java.util.AbstractList

modCount

Constructor Summary

Constructors

Constructor	Description
DFSFinishTimeIterator()

Method Summary

Modifier and Type	Method	Description
protected Iterator<T>	getConnected(@Nullable T n)	get the out edges of a given node
boolean	hasNext()	Return whether there are any more nodes left to enumerate.
protected void	init(Graph<T> G, Iterator<? extends T> nodes)	Subclasses must call this in the constructor!
@Nullable T	next()	Find the next graph node in finishing time order.
void	remove()

Methods inherited from class java.util.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 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, reversed

Constructor Details

DFSFinishTimeIterator

public DFSFinishTimeIterator()

Method Details

init

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

Subclasses must call this in the constructor!

hasNext

public boolean hasNext()

Return whether there are any more nodes left to enumerate.

Specified by:

hasNext in interface Iterator<T>

Returns:

true if there nodes left to enumerate.

next

public @Nullable T next()
                 throws NoSuchElementException

Find the next graph node in finishing time order.

Specified by:

next in interface Iterator<T>

Returns:

the next graph node in finishing time order.

Throws:

NoSuchElementException

getConnected

protected Iterator<T> getConnected(@Nullable T n)

get the out edges of a given node

Parameters:

n - the node of which to get the out edges

Returns:

the out edges

remove

public void remove()
            throws UnimplementedError

Specified by:

remove in interface Iterator<T>

Throws:

UnimplementedError