Interface EdgeManager<T>
- Type Parameters:
T
- the type of node in the graph
- All Known Subinterfaces:
CallGraph
,ControlFlowGraph<I,
,T> Graph<T>
,HeapGraph<T>
,IFlowGraph
,ISDG
,ISupergraph<T,
,P> LabeledEdgeManager<T,
,U> LabeledGraph<T,
,U> MinimalCFG<T>
,NumberedEdgeManager<T>
,NumberedGraph<T>
,NumberedLabeledEdgeManager<T,
,U> NumberedLabeledGraph<T,
,I> OrderedMultiGraph<T>
,SerializableGraph<T>
- All Known Implementing Classes:
AbstractCFG
,AbstractDemandFlowGraph
,AbstractFlowGraph
,AbstractGraph
,AbstractInterproceduralCFG
,AbstractLabeledGraph
,AbstractNumberedGraph
,AbstractNumberedLabeledGraph
,AstCallGraph
,AstInducedCFG
,AstTranslator.AstCFG
,AstTranslator.IncipientCFG
,BackwardsSupergraph
,BasicCallGraph
,BasicEdgeManager
,BasicGraph
,BasicHeapGraph
,BasicOrderedMultiGraph
,CHACallGraph
,CISDG
,ControlDependenceGraph
,CrossLanguageCallGraph
,DelegatingCFG
,DelegatingExplicitCallGraph
,DelegatingGraph
,DelegatingNumberedEdgeManager
,DelegatingNumberedGraph
,DemandPointerFlowGraph
,DemandValueFlowGraph
,DexCFG
,EdgeFilteredNumberedGraph
,ExplicitCallGraph
,ExplicitCallGraph.ExplicitEdgeManager
,ExplicitPredecessorsEdgeManager
,ExplodedControlFlowGraph
,ExplodedInterproceduralCFG
,ExtensionGraph
,HeapGraphImpl
,ICFGSupergraph
,InducedCFG
,InterproceduralCFG
,InvertedGraph
,InvertedNumberedGraph
,InvertingEdgeManager
,InvertingNumberedEdgeManager
,JSCallGraph
,JSInducedCFG
,MutableCFG
,PartialCallGraph
,PDG
,PrefixTransferGraph
,PrunedCallGraph
,PrunedCFG
,RandomGraph
,RandomGraph.IntegerRandomGraph
,SDG
,SelfLoopAddedEdgeManager
,SelfLoopAddedGraph
,ShrikeCFG
,SimpleDemandPointerFlowGraph
,SlowSparseNumberedGraph
,SlowSparseNumberedLabeledGraph
,SparseNumberedEdgeManager
,SparseNumberedGraph
,SparseNumberedLabeledEdgeManager
,SSACFG
,UriPrefixTransferGraph
public interface EdgeManager<T>
An object which manages edges in a directed graph.
-
Method Summary
Modifier and TypeMethodDescriptionvoid
int
Return the number ofimmediate predecessor
nodes of ngetPredNodes
(@Nullable T n) Return anIterator
over the immediate predecessor nodes of nint
Return the number ofimmediate successor
nodes of this Node in the GraphgetSuccNodes
(@Nullable T n) Return an Iterator over the immediate successor nodes of nboolean
void
removeAllIncidentEdges
(T node) void
removeEdge
(T src, T dst) void
removeIncomingEdges
(T node) void
removeOutgoingEdges
(T node)
-
Method Details
-
getPredNodes
-
getPredNodeCount
Return the number ofimmediate predecessor
nodes of n- Returns:
- the number of immediate predecessors of n.
-
getSuccNodes
-
getSuccNodeCount
Return the number ofimmediate successor
nodes of this Node in the Graph- Returns:
- the number of immediate successor Nodes of this Node in the Graph.
-
addEdge
-
removeEdge
- Throws:
UnsupportedOperationException
-
removeAllIncidentEdges
- Throws:
UnsupportedOperationException
-
removeIncomingEdges
- Throws:
UnsupportedOperationException
-
removeOutgoingEdges
- Throws:
UnsupportedOperationException
-
hasEdge
-