Class NumberedDFSFinishTimeIterator<T>

java.lang.Object

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

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

All Implemented Interfaces:

Serializable, Iterator<T>

public class NumberedDFSFinishTimeIterator<T>
extends DFSFinishTimeIterator<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

Method Summary

Methods inherited from class DFSFinishTimeIterator

getConnected, hasNext, init, next, remove

Modifier and Type	Method	Description
protected Iterator<T>	getConnected(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!
T	next()	Find the next graph node in finishing time order.
void	remove()

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface Iterator

forEachRemaining