Package com.ibm.wala.util.graph.impl
@NullMarked
package com.ibm.wala.util.graph.impl
Graph implementations
-
ClassesClassDescriptionSimple implementation of an
EdgeManager.BasicGraph<T>Basic implementation of aGraph.Simple implementation of aNodeManager.Inefficient implementation of OrderedMultiGraph.A utility class.An object that delegates edge management to the nodes,INodeWithNumberedEdgesDelegatingNumberedGraph<T extends INodeWithNumberedEdges>Basic functionality for a graph that delegates node and edge management, and tracks node numbersDelegatingNumberedNodeManager<T extends INodeWithNumber>Basic implementation of a numbered graph -- this implementation relies on nodes that carry numbers and edges.A graph view that reverses the edges in a graphA graph view that reverses the edges in a graphA graph view that reverses the edges in a graphAn edge manager that reverses the edges in a graphAn edge manager that reverses the edges in a graphA node which carries it's own number; which identifies it in aNumberedGraphimplementation.Simple implementation ofINodeWithNumberedEdgesRandomGraph<T>An object which manages node numbers via a mapping.A graph of numbered nodes, expected to have a fairly sparse edge structure.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.