Interface NumberedLabeledEdgeManager<T,U>

All Superinterfaces:

EdgeManager<T>, LabeledEdgeManager<T,U>, NumberedEdgeManager<T>

All Known Subinterfaces:

NumberedLabeledGraph<T,I>

All Known Implementing Classes:

AbstractDemandFlowGraph, AbstractFlowGraph, AbstractNumberedLabeledGraph, DemandPointerFlowGraph, DemandValueFlowGraph, PDG, SlowSparseNumberedLabeledGraph, SparseNumberedLabeledEdgeManager

public interface NumberedLabeledEdgeManager<T,U>
extends LabeledEdgeManager<T,U>, NumberedEdgeManager<T>

Method Summary

Modifier and Type	Method	Description
IntSet	getPredNodeNumbers(T node, U label)
IntSet	getSuccNodeNumbers(T node, U label)

Methods inherited from interface EdgeManager

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

Modifier and Type	Method	Description
void	addEdge(T src, T dst)
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)
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeIncomingEdges(T node)
void	removeOutgoingEdges(T node)

Methods inherited from interface LabeledEdgeManager

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

Modifier and Type	Method	Description
void	addEdge(T src, T dst, U label)	adds an edge with some label
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.
default Iterator<T>	getPredNodes(T N, Predicate<U> pred)
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 interface NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

Modifier and Type	Method	Description
IntSet	getPredNodeNumbers(T node)
IntSet	getSuccNodeNumbers(T node)

Method Details

getPredNodeNumbers

IntSet getPredNodeNumbers(T node,
 U label)
                   throws IllegalArgumentException

Throws:

IllegalArgumentException

getSuccNodeNumbers

IntSet getSuccNodeNumbers(T node,
 U label)
                   throws IllegalArgumentException

Throws:

IllegalArgumentException