Class AbstractNumberedLabeledGraph<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>

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>, Iterable<T>

Direct Known Subclasses:

SlowSparseNumberedLabeledGraph

public abstract class AbstractNumberedLabeledGraph<T,U>
extends AbstractNumberedGraph<T>
implements LabeledGraph<T,U>, NumberedLabeledGraph<T,U>

Constructor Summary

Constructors

Constructor	Description
AbstractNumberedLabeledGraph()

Method Summary

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)
@Nullable 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
protected abstract NumberedLabeledEdgeManager<T,U>	getEdgeManager()
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, getNodeManager, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes

Methods inherited from class AbstractGraph

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

Methods inherited from class Object

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

Methods inherited from interface EdgeManager

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

Methods inherited from interface Graph

removeNodeAndEdges

Methods inherited from interface Iterable

forEach, spliterator

Methods inherited from interface LabeledEdgeManager

getPredNodes

Methods inherited from interface NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Methods inherited from interface NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

Methods inherited from interface NumberedNodeManager

getMaxNumber, getNode, getNumber, iterateNodes

Constructor Details

AbstractNumberedLabeledGraph

public AbstractNumberedLabeledGraph()

Method Details

getEdgeManager

protected abstract NumberedLabeledEdgeManager<T,U> getEdgeManager()

Specified by:

getEdgeManager in class AbstractNumberedGraph<T>

Returns:

the object which manages edges in the graph

addEdge

public void addEdge(T src,
 T dst,
 U label)

Description copied from interface: LabeledEdgeManager

adds an edge with some label

Specified by:

addEdge in interface LabeledEdgeManager<T,U>

getPredLabels

public Iterator<? extends U> getPredLabels(T N)

Specified by:

getPredLabels in interface LabeledEdgeManager<T,U>

Returns:

the labels on edges whose destination is N

getPredNodeCount

public int getPredNodeCount(T N,
 U label)

Description copied from interface: LabeledEdgeManager

Return the number of immediate predecessor nodes of this Node in the Graph on edges with some label.

Specified by:

getPredNodeCount in interface LabeledEdgeManager<T,U>

Returns:

the number of immediate predecessor Nodes of this Node in the Graph.

getPredNodes

public Iterator<T> getPredNodes(T N,
 U label)

Description copied from interface: LabeledEdgeManager

Return an Iterator over the immediate predecessor nodes of this Node in the Graph on edges with some label.

This method never returns null.

Specified by:

getPredNodes in interface LabeledEdgeManager<T,U>

Returns:

an Iterator over the immediate predecessor nodes of this Node.

getSuccLabels

public Iterator<? extends U> getSuccLabels(T N)

Specified by:

getSuccLabels in interface LabeledEdgeManager<T,U>

Returns:

the labels on edges whose source is N

getSuccNodeCount

public int getSuccNodeCount(T N,
 U label)

Description copied from interface: LabeledEdgeManager

Return the number of immediate successor nodes of this Node in the Graph

Specified by:

getSuccNodeCount in interface LabeledEdgeManager<T,U>

Returns:

the number of immediate successor Nodes of this Node in the Graph.

getSuccNodes

public Iterator<? extends T> getSuccNodes(T N,
 U label)

Description copied from interface: LabeledEdgeManager

Return an Iterator over the immediate successor nodes of this Node in the Graph on edges with some label.

This method never returns null.

Specified by:

getSuccNodes in interface LabeledEdgeManager<T,U>

Returns:

an Iterator over the immediate successor Nodes of this Node.

getPredNodeNumbers

public IntSet getPredNodeNumbers(T node,
 U label)
                          throws IllegalArgumentException

Specified by:

getPredNodeNumbers in interface NumberedLabeledEdgeManager<T,U>

Throws:

IllegalArgumentException

getSuccNodeNumbers

public IntSet getSuccNodeNumbers(T node,
 U label)
                          throws IllegalArgumentException

Specified by:

getSuccNodeNumbers in interface NumberedLabeledEdgeManager<T,U>

Throws:

IllegalArgumentException

hasEdge

public boolean hasEdge(T src,
 T dst,
 U label)

Specified by:

hasEdge in interface LabeledEdgeManager<T,U>

removeEdge

public void removeEdge(T src,
 T dst,
 U label)

Specified by:

removeEdge in interface LabeledEdgeManager<T,U>

getEdgeLabels

public Set<? extends U> getEdgeLabels(T src,
 T dst)

Description copied from interface: LabeledEdgeManager

Returns a set of all labeled edges between node src and node dst

Specified by:

getEdgeLabels in interface LabeledEdgeManager<T,U>

Parameters:

src - source node of the edge

dst - target node of the edge

Returns:

Set of edge labels

getDefaultLabel

public @Nullable U getDefaultLabel()

Description copied from interface: LabeledEdgeManager

Sets the default object used as label for operations where no specific edge label is provided. This is due to compatibility with the EdgeManager interface

Specified by:

getDefaultLabel in interface LabeledEdgeManager<T,U>

edgeString

protected String edgeString(T from,
 T to)

Overrides:

edgeString in class AbstractGraph<T>