Interface NumberedEdgeManager<T>

All Superinterfaces:

EdgeManager<T>

All Known Subinterfaces:

CallGraph, ControlFlowGraph<I,T>, HeapGraph<T>, ISDG, ISupergraph<T,P>, MinimalCFG<T>, NumberedGraph<T>, NumberedLabeledEdgeManager<T,U>, NumberedLabeledGraph<T,I>

All Known Implementing Classes:

AbstractCFG, AbstractDemandFlowGraph, AbstractFlowGraph, AbstractInterproceduralCFG, AbstractNumberedGraph, AbstractNumberedLabeledGraph, AstCallGraph, AstInducedCFG, AstTranslator.AstCFG, AstTranslator.IncipientCFG, BackwardsSupergraph, BasicCallGraph, BasicHeapGraph, CHACallGraph, CISDG, ControlDependenceGraph, CrossLanguageCallGraph, DelegatingCFG, DelegatingExplicitCallGraph, DelegatingNumberedEdgeManager, DelegatingNumberedGraph, DemandPointerFlowGraph, DemandValueFlowGraph, DexCFG, EdgeFilteredNumberedGraph, ExplicitCallGraph, ExplicitCallGraph.ExplicitEdgeManager, ExplicitPredecessorsEdgeManager, ExplodedControlFlowGraph, ExplodedInterproceduralCFG, ExtensionGraph, HeapGraphImpl, ICFGSupergraph, InducedCFG, InterproceduralCFG, InvertedNumberedGraph, InvertingNumberedEdgeManager, JSCallGraph, JSInducedCFG, MutableCFG, PartialCallGraph, PDG, PrunedCallGraph, PrunedCFG, RandomGraph, RandomGraph.IntegerRandomGraph, SDG, ShrikeCFG, SimpleDemandPointerFlowGraph, SlowSparseNumberedGraph, SlowSparseNumberedLabeledGraph, SparseNumberedEdgeManager, SparseNumberedGraph, SparseNumberedLabeledEdgeManager, SSACFG

public interface NumberedEdgeManager<T>
extends EdgeManager<T>

Additional functionality for edges in numbered graphs

Method Summary

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

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)

Method Details

getSuccNodeNumbers

IntSet getSuccNodeNumbers(@Nullable T node)

Returns:

the numbers identifying the immediate successors of node

getPredNodeNumbers

IntSet getPredNodeNumbers(@Nullable T node)

Returns:

the numbers identifying the immediate predecessors of node