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

Graph traversal algorithms

See:
Description

Interface Summary

FloydWarshall.GetPath<T>
FloydWarshall.GetPaths<T>

Class Summary

BFSIterator<T>	This class implements breadth-first search over a Graph, returning an Iterator of the nodes of the graph in order of discovery.
BFSPathFinder<T>	This class searches breadth-first for node that matches some criteria.
BoundedBFSIterator<T>	This class implements breadth-first search over a Graph, returning an Iterator of the nodes of the graph in order of discovery.
DFS	utilities related to depth-first search.
DFSAllPathsFinder<T>
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.
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.
DFSPathFinder<T>	This class searches depth-first search for node that matches some criteria.
FloydWarshall<T>
NumberedDFSDiscoverTimeIterator<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.
NumberedDFSFinishTimeIterator<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.
SCCIterator<T>	This class computes strongly connected components for a Graph (or a subset of it).
SlowDFSDiscoverTimeIterator<T>	This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing discover time.
SlowDFSFinishTimeIterator<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.
Topological	Utilities for iterating over graphs in topological order.
WelshPowell<T>

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

Graph traversal algorithms