Package com.ibm.wala.util.graph.impl

Graph implementations

See:
Description

Class Summary

BasicNodeManager<T>	Simple implementation of a NodeManager.
BasicOrderedMultiGraph<T>	Inefficient implementation of OrderedMultiGraph.
DelegatingGraph<T>	A utility class.
DelegatingNumberedEdgeManager<T extends INodeWithNumberedEdges>	An object that delegates edge management to the nodes, INodeWithNumberedEdges
DelegatingNumberedGraph<T extends INodeWithNumberedEdges>	Basic functionality for a graph that delegates node and edge management, and tracks node numbers
DelegatingNumberedNodeManager<T extends INodeWithNumber>	Basic implementation of a numbered graph -- this implementation relies on nodes that carry numbers and edges.
GraphInverter	A graph view that reverses the edges in a graph
InvertedGraph<T>	A graph view that reverses the edges in a graph
InvertedNumberedGraph<T>	A graph view that reverses the edges in a graph
InvertingEdgeManager<T>	An edge manager that reverses the edges in a graph
InvertingNumberedEdgeManager<T>	An edge manager that reverses the edges in a graph
NodeWithNumber	A node which carries it's own number; which identifies it in a NumberedGraph implementation.
NodeWithNumberedEdges	Simple implementation of INodeWithNumberedEdges
NumberedNodeIterator<T>
SlowNumberedNodeManager<T>	An object which manages node numbers via a mapping.
SlowSparseNumberedGraph<T>	A graph of numbered nodes, expected to have a fairly sparse edge structure.
SparseNumberedEdgeManager<T>	An object which tracks edges for nodes that have numbers.
SparseNumberedGraph<T extends INodeWithNumber>	A graph of numbered nodes, expected to have a fairly sparse edge structure.

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

Graph implementations