Class SlowSparseNumberedGraph<T>

java.lang.Object

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

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

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

All Implemented Interfaces:

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

Direct Known Subclasses:

RandomGraph, SimpleDemandPointerFlowGraph

public class SlowSparseNumberedGraph<T>
extends AbstractNumberedGraph<T>
implements Serializable

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

See Also:

• Serialized Form

Constructor Summary

Constructors

Modifier	Constructor	Description
protected	SlowSparseNumberedGraph()
	SlowSparseNumberedGraph(int normalOutCount)	If normalOutCount == n, this edge manager will eagerly allocated n words to hold out edges for each node.

Method Summary

Modifier and Type	Method	Description
static <T> void	copyInto(Graph<T> g, Graph<T> into)
static <T> SlowSparseNumberedGraph<T>	duplicate(Graph<T> g)
NumberedEdgeManager<T>	getEdgeManager()
NumberedNodeManager<T>	getNodeManager()
static <T> SlowSparseNumberedGraph<T>	make()

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

SlowSparseNumberedGraph

protected SlowSparseNumberedGraph()

SlowSparseNumberedGraph

public SlowSparseNumberedGraph(int normalOutCount)

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

Parameters:

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

Method Details

getNodeManager

public NumberedNodeManager<T> getNodeManager()

Specified by:

getNodeManager in class AbstractNumberedGraph<T>

Returns:

the object which manages nodes in the graph

See Also:

• AbstractGraph.getNodeManager()

getEdgeManager

public NumberedEdgeManager<T> getEdgeManager()

Specified by:

getEdgeManager in class AbstractNumberedGraph<T>

Returns:

the object which manages edges in the graph

See Also:

• AbstractGraph.getEdgeManager()

duplicate

public static <T> SlowSparseNumberedGraph<T> duplicate(Graph<T> g)

Returns:

a graph with the same nodes and edges as g

copyInto

public static <T> void copyInto(Graph<T> g,
 Graph<T> into)

make

public static <T> SlowSparseNumberedGraph<T> make()