Class SparseNumberedGraph<T extends INodeWithNumber>

java.lang.Object

com.ibm.wala.util.graph.AbstractGraph<T>

com.ibm.wala.util.graph.AbstractNumberedGraph<T>

com.ibm.wala.util.graph.impl.SparseNumberedGraph<T>

All Implemented Interfaces:

EdgeManager<T>, Graph<T>, NodeManager<T>, NumberedEdgeManager<T>, NumberedGraph<T>, NumberedNodeManager<T>, Iterable<T>

Direct Known Subclasses:

AstTranslator.IncipientCFG, MutableCFG

public class SparseNumberedGraph<T extends INodeWithNumber>
extends AbstractNumberedGraph<T>

A graph of numbered nodes, expected to have a fairly sparse edge structure.

Constructor Summary

Constructors

Constructor	Description
SparseNumberedGraph()
SparseNumberedGraph(int normalCase)	If normalCase == n, the s edge manager will eagerly allocated n words to hold out edges for each node.
SparseNumberedGraph(DelegatingNumberedNodeManager<T> nodeManager, SparseNumberedEdgeManager<T> edgeManager)

Method Summary

Modifier and Type	Method	Description
protected NumberedEdgeManager<T>	getEdgeManager()
protected NumberedNodeManager<T>	getNodeManager()

Methods inherited from class AbstractNumberedGraph

getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes

Modifier and Type	Method	Description
int	getMaxNumber()
T	getNode(int number)
int	getNumber(T N)
IntSet	getPredNodeNumbers(T node)
IntSet	getSuccNodeNumbers(T node)
Iterator<T>	iterateNodes(IntSet s)

Methods inherited from class AbstractGraph

addEdge, addNode, containsNode, edgeString, getNumberOfNodes, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, iterator, nodeString, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, stream, toString

Modifier and Type	Method	Description
void	addEdge(T src, T dst)
void	addNode(T n)	add a node to this graph
boolean	containsNode(T n)
protected String	edgeString(T from, T to)
int	getNumberOfNodes()
int	getPredNodeCount(T n)	Return the number of immediate predecessor nodes of n
Iterator<T>	getPredNodes(T n)	Return an Iterator over the immediate predecessor nodes of n
int	getSuccNodeCount(T n)	Return the number of immediate successor nodes of this Node in the Graph
Iterator<T>	getSuccNodes(T n)	Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(T src, T dst)
Iterator<T>	iterator()
protected String	nodeString(T n, boolean forEdge)
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeIncomingEdges(T node)
void	removeNode(T n)	remove a node from this graph
void	removeNodeAndEdges(T N)	remove a node and all its incident edges
void	removeOutgoingEdges(T node)
Stream<T>	stream()
String	toString()

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface Iterable

forEach, spliterator

Constructor Details

SparseNumberedGraph

public SparseNumberedGraph()

SparseNumberedGraph

public SparseNumberedGraph(int normalCase)

If normalCase == n, the s edge manager will eagerly allocated n words to hold out edges for each node. (performance optimization for time)

Parameters:

normalCase - what is the "normal" number of out edges for a node?

SparseNumberedGraph

public SparseNumberedGraph(DelegatingNumberedNodeManager<T> nodeManager,
 SparseNumberedEdgeManager<T> edgeManager)

Method Details

getNodeManager

protected NumberedNodeManager<T> getNodeManager()

Specified by:

getNodeManager in class AbstractNumberedGraph<T extends INodeWithNumber>

Returns:

the object which manages nodes in the graph

See Also:

• AbstractGraph.getNodeManager()

getEdgeManager

protected NumberedEdgeManager<T> getEdgeManager()

Specified by:

getEdgeManager in class AbstractNumberedGraph<T extends INodeWithNumber>

Returns:

the object which manages edges in the graph

See Also:

• AbstractGraph.getEdgeManager()