Package com.ibm.wala.util.graph

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 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