Class AbstractLabeledGraph<T,U>

java.lang.Object

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

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

All Implemented Interfaces:

EdgeManager<T>, Graph<T>, LabeledEdgeManager<T,U>, LabeledGraph<T,U>, NodeManager<T>, Iterable<T>

public abstract class AbstractLabeledGraph<T,U>
extends AbstractGraph<T>
implements LabeledGraph<T,U>

Constructor Summary

Constructors

Constructor	Description
AbstractLabeledGraph()

Method Summary

Modifier and Type	Method	Description
void	addEdge(T src, T dst, U label)	adds an edge with some label
Set<? extends U>	getEdgeLabels(T src, T dst)	Returns a set of all labeled edges between node src and node dst
protected abstract LabeledEdgeManager<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.
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
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 AbstractGraph

addEdge, addNode, containsNode, edgeString, getNodeManager, 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)
protected abstract NodeManager<T>	getNodeManager()
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

getDefaultLabel, getPredNodes

Modifier and Type	Method	Description
U	getDefaultLabel()	Sets the default object used as label for operations where no specific edge label is provided.
default Iterator<T>	getPredNodes(T N, Predicate<U> pred)

Constructor Details

AbstractLabeledGraph

public AbstractLabeledGraph()

Method Details

getEdgeManager

protected abstract LabeledEdgeManager<T,U> getEdgeManager()

Specified by:

getEdgeManager in class AbstractGraph<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.

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