NumberedEdgeManager (com.ibm.wala.util 1.5.2 API)

All Superinterfaces:: EdgeManager<T>

All Known Subinterfaces:: NumberedGraph<T>, NumberedLabeledEdgeManager<T,U>, NumberedLabeledGraph<T,I>

All Known Implementing Classes:: AbstractNumberedGraph, AbstractNumberedLabeledGraph, DelegatingNumberedEdgeManager, DelegatingNumberedGraph, EdgeFilteredNumberedGraph, ExtensionGraph, InvertedNumberedGraph, InvertingNumberedEdgeManager, SlowSparseNumberedGraph, SlowSparseNumberedLabeledGraph, SparseNumberedEdgeManager, SparseNumberedGraph, SparseNumberedLabeledEdgeManager

public interface NumberedEdgeManager<T> extends EdgeManager<T>

Additional functionality for edges in numbered graphs

Method Summary

Modifier and Type

Method

Description

IntSet

getPredNodeNumbers(T node)

IntSet

getSuccNodeNumbers(T node)

Methods inherited from interface com.ibm.wala.util.graph.EdgeManager
addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges

Method Details
- getSuccNodeNumbers
  
  IntSet getSuccNodeNumbers(T node)
  
  Returns:
  
  the numbers identifying the immediate successors of node
- getPredNodeNumbers
  
  IntSet getPredNodeNumbers(T node)
  
  Returns:
  
  the numbers identifying the immediate predecessors of node