Class SlowSparseNumberedLabeledGraph<T,U>

java.lang.Object

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

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

com.ibm.wala.util.graph.labeled.AbstractNumberedLabeledGraph<T,U>

com.ibm.wala.util.graph.labeled.SlowSparseNumberedLabeledGraph<T,U>

All Implemented Interfaces:

EdgeManager<T>, Graph<T>, LabeledEdgeManager<T,U>, LabeledGraph<T,U>, NumberedLabeledEdgeManager<T,U>, NumberedLabeledGraph<T,U>, NodeManager<T>, NumberedEdgeManager<T>, NumberedGraph<T>, NumberedNodeManager<T>, Serializable, Iterable<T>

Direct Known Subclasses:

AbstractFlowGraph

public class SlowSparseNumberedLabeledGraph<T,U>
extends AbstractNumberedLabeledGraph<T,U>
implements Serializable

A labeled graph implementation suitable for sparse graphs.

See Also:

• Serialized Form

Constructor Summary

Constructors

Constructor	Description
SlowSparseNumberedLabeledGraph()
SlowSparseNumberedLabeledGraph(@Nullable U defaultLabel)

Method Summary

Modifier and Type	Method	Description
static <T,U> void	copyInto(LabeledGraph<T,U> g, LabeledGraph<T,U> into)
static <T,U> SlowSparseNumberedLabeledGraph<T,U>	duplicate(LabeledGraph<T,U> g)
protected NumberedLabeledEdgeManager<T,U>	getEdgeManager()
protected NumberedNodeManager<T>	getNodeManager()

Methods inherited from class AbstractNumberedLabeledGraph

addEdge, edgeString, getDefaultLabel, getEdgeLabels, getPredLabels, getPredNodeCount, getPredNodeNumbers, getPredNodes, getSuccLabels, getSuccNodeCount, getSuccNodeNumbers, getSuccNodes, hasEdge, removeEdge

Modifier and Type	Method	Description
void	addEdge(T src, T dst, U label)	adds an edge with some label
protected String	edgeString(T from, T to)
U	getDefaultLabel()	Sets the default object used as label for operations where no specific edge label is provided.
Set<? extends U>	getEdgeLabels(T src, T dst)	Returns a set of all labeled edges between node src and node dst
Iterator<? extends U>	getPredLabels(T N)
int	getPredNodeCount(T N, U label)	Return the number of immediate predecessor nodes of this Node in the Graph on edges with some label.
IntSet	getPredNodeNumbers(T node, U label)
Iterator<T>	getPredNodes(T N, U label)	Return an Iterator over the immediate predecessor nodes of this Node in the Graph on edges with some label.
Iterator<? extends U>	getSuccLabels(T N)
int	getSuccNodeCount(T N, U label)	Return the number of immediate successor nodes of this Node in the Graph
IntSet	getSuccNodeNumbers(T node, U label)
Iterator<? extends T>	getSuccNodes(T N, U label)	Return an Iterator over the immediate successor nodes of this Node in the Graph on edges with some label.
boolean	hasEdge(T src, T dst, U label)
void	removeEdge(T src, T dst, U label)

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

Methods inherited from interface LabeledEdgeManager

getPredNodes

Modifier and Type	Method	Description
default Iterator<T>	getPredNodes(T N, Predicate<U> pred)

Constructor Details

SlowSparseNumberedLabeledGraph

public SlowSparseNumberedLabeledGraph()

SlowSparseNumberedLabeledGraph

public SlowSparseNumberedLabeledGraph(@Nullable U defaultLabel)

Method Details

duplicate

public static <T,U>
SlowSparseNumberedLabeledGraph<T,U> duplicate(LabeledGraph<T,U> g)

Returns:

a graph with the same nodes and edges as g

copyInto

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

getEdgeManager

protected NumberedLabeledEdgeManager<T,U> getEdgeManager()

Specified by:

getEdgeManager in class AbstractNumberedLabeledGraph<T,U>

Returns:

the object which manages edges in the graph

getNodeManager

protected NumberedNodeManager<T> getNodeManager()

Specified by:

getNodeManager in class AbstractNumberedGraph<T>

Returns:

the object which manages nodes in the graph