Interface NumberedLabeledGraph<T,I>

All Superinterfaces:

EdgeManager<T>, Graph<T>, Iterable<T>, LabeledEdgeManager<T,I>, NodeManager<T>, NumberedEdgeManager<T>, NumberedGraph<T>, NumberedLabeledEdgeManager<T,I>, NumberedNodeManager<T>

All Known Implementing Classes:

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

public interface NumberedLabeledGraph<T,I>
extends NumberedGraph<T>, NumberedLabeledEdgeManager<T,I>

Method Summary

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 Graph

removeNodeAndEdges

Modifier and Type	Method	Description
void	removeNodeAndEdges(T n)	remove a node and all its incident edges

Methods inherited from interface Iterable

forEach, spliterator

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, I label)	adds an edge with some label
I	getDefaultLabel()	Sets the default object used as label for operations where no specific edge label is provided.
Set<? extends I>	getEdgeLabels(T src, T dst)	Returns a set of all labeled edges between node src and node dst
Iterator<? extends I>	getPredLabels(T N)
int	getPredNodeCount(T N, I 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<I> pred)
Iterator<T>	getPredNodes(T N, I label)	Return an Iterator over the immediate predecessor nodes of this Node in the Graph on edges with some label.
Iterator<? extends I>	getSuccLabels(T N)
int	getSuccNodeCount(T N, I label)	Return the number of immediate successor nodes of this Node in the Graph
Iterator<? extends T>	getSuccNodes(T N, I 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, I label)
void	removeEdge(T src, T dst, I label)

Methods inherited from interface NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Modifier and Type	Method	Description
void	addNode(T n)	add a node to this graph
boolean	containsNode(T n)
int	getNumberOfNodes()
default Iterator<T>	iterator()
void	removeNode(T n)	remove a node from this graph
Stream<T>	stream()

Methods inherited from interface NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

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

Methods inherited from interface NumberedLabeledEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

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

Methods inherited from interface NumberedNodeManager

getMaxNumber, getNode, getNumber, iterateNodes

Modifier and Type	Method	Description
int	getMaxNumber()
T	getNode(int number)
int	getNumber(T N)
Iterator<T>	iterateNodes(IntSet s)