Package com.ibm.wala.util.graph

Graph interfaces

See:
Description

Interface Summary

EdgeManager<T>	An object which manages edges in a directed graph.
Graph<T>	Basic interface for a directed graph.
INodeWithNumber	Basic interface for a node which lives in one graph ...
INodeWithNumberedEdges	Basic interface for a node which lives in one graph ...
NodeManager<T>	An object which tracks graph nodes.
NumberedEdgeManager<T>	Additional functionality for edges in numbered graphs
NumberedGraph<T>	A numbered graph is a Graph where each node has a unique persistent non-negative integer id.
NumberedNodeManager<T>	An object which tracks nodes with numbers.
OrderedMultiGraph<T>

Class Summary

AbstractGraph<T>	Basic functionality for a graph that delegates node and edge management.
AbstractNumberedGraph<T>	Basic functionality for a graph that delegates node and edge management, and tracks node numbers
Acyclic	Utilities for dealing with acyclic subgraphs
BasicTree<T>	A simple, extremely inefficient tree implementation
GraphIntegrity	Utility class to check integrity of a graph data structure.
GraphPrint	Simple graph printing utility
GraphReachability<T>	A dataflow system that computes, for each graph node, the set of "interesting" nodes that are reachable
GraphSlicer
InferGraphRoots	TODO: Move this somewhere.
Path	We represent a path in a numbered graph as a vector of integers where node i_1 is the src and node i_n is the sink

Exception Summary

GraphIntegrity.UnsoundGraphException

Package com.ibm.wala.util.graph Description

Graph interfaces