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

Graph traversal algorithms

See:
Description

Interface Summary

DFSVisit.SimpleMap<K,V>

A simple map interface.

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.
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.
DFSVisit	Depth first search of a graph using a stack instead of recursive method calls.
DFSVisit.DefaultSimpleMap<K,V>	Default implementation of DFSVisit.SimpleMapbased on a HashMap
DFSVisit.NumberedSimpleMap<K,V>	A DFSVisit.SimpleMapthat maps INodeWithNumberto their traversal state.
DFSVisit.Visitor	A visitor that visits Nodes in the DFS2 of a graph
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.

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

Graph traversal algorithms