Package com.ibm.wala.util.graph
package com.ibm.wala.util.graph
-
ClassDescriptionBasic functionality for a
Graphthat delegates node and edge management.Basic functionality for a graph that delegates node and edge management, and tracks node numbersUtilities for dealing with acyclic subgraphsBasicTree<T>A simple, extremely inefficient tree implementationView of aNumberedGraphin which some edges have been filtered outEdgeManager<T>An object which manages edges in a directed graph.Graph<T>Basic interface for a directed graph.Utility class to check integrity of a graph data structure.Simple graph printing utilityGraphReachability<T,S> A dataflow system that computes, for each graph node, the set of "interesting" nodes that are reachableUtilities related to simple graph subset operations.Utility methods for graphs.TODO: Move this somewhere.Basic interface for a node which lives in one graph ...Basic interface for a node which lives in one graph ...NodeManager<T>An object which tracks graph nodes.Additional functionality for edges in numbered graphsA numbered graph is aGraphwhere each node has a unique persistent non-negative integer id.An object which tracks nodes with numbers.We represent a path in a numbered graph as a vector of integers <i_1, ..., i_n> where node i_1 is the src and node i_n is the sinkSerializableGraph<T extends Serializable>