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

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 com.ibm.wala.util.graph.AbstractNumberedGraph

getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes

Methods inherited from class com.ibm.wala.util.graph.AbstractGraph

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

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.ibm.wala.util.graph.EdgeManager

addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges

Methods inherited from interface com.ibm.wala.util.graph.Graph

removeNodeAndEdges

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface com.ibm.wala.util.graph.NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

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()