Interface NumberedGraph<T>
- All Superinterfaces:
EdgeManager<T>
,Graph<T>
,Iterable<T>
,NodeManager<T>
,NumberedEdgeManager<T>
,NumberedNodeManager<T>
- All Known Subinterfaces:
CallGraph
,ControlFlowGraph<I,
,T> HeapGraph<T>
,ISDG
,ISupergraph<T,
,P> MinimalCFG<T>
,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
,DelegatingNumberedGraph
,DemandPointerFlowGraph
,DemandValueFlowGraph
,DexCFG
,EdgeFilteredNumberedGraph
,ExplicitCallGraph
,ExplodedControlFlowGraph
,ExplodedInterproceduralCFG
,ExtensionGraph
,HeapGraphImpl
,ICFGSupergraph
,InducedCFG
,InterproceduralCFG
,InvertedNumberedGraph
,JSCallGraph
,JSInducedCFG
,MutableCFG
,PartialCallGraph
,PDG
,PrunedCallGraph
,PrunedCFG
,RandomGraph
,RandomGraph.IntegerRandomGraph
,SDG
,ShrikeCFG
,SimpleDemandPointerFlowGraph
,SlowSparseNumberedGraph
,SlowSparseNumberedLabeledGraph
,SparseNumberedGraph
,SSACFG
A numbered graph is a
Graph
where each node has a unique persistent non-negative integer
id.-
Method Summary
Methods inherited from interface com.ibm.wala.util.graph.EdgeManager
addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges
Methods inherited from interface com.ibm.wala.util.graph.Graph
removeNodeAndEdges
Methods inherited from interface java.lang.Iterable
forEach, spliterator
Methods inherited from interface com.ibm.wala.util.graph.NodeManager
addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream
Methods inherited from interface com.ibm.wala.util.graph.NumberedEdgeManager
getPredNodeNumbers, getSuccNodeNumbers
Methods inherited from interface com.ibm.wala.util.graph.NumberedNodeManager
getMaxNumber, getNode, getNumber, iterateNodes