public interface ISDG extends com.ibm.wala.util.graph.NumberedGraph<Statement>, IClassHierarchyDweller
Statements. This interface
implies that the underlying graph is computed lazily on demand.| Modifier and Type | Method and Description |
|---|---|
Slicer.ControlDependenceOptions |
getCOptions()
Slicer.ControlDependenceOptions used to construct this graph. |
PDG<? extends InstanceKey> |
getPDG(CGNode node)
Get the program dependence graph constructed for a particular node.
|
java.util.Iterator<? extends Statement> |
iterateLazyNodes()
Iterate over the nodes which have been discovered so far, but do NOT eagerly construct
the entire graph.
|
getMaxNumber, getNode, getNumber, iterateNodesaddNode, containsNode, getNumberOfNodes, iterator, removeNode, streamgetPredNodeNumbers, getSuccNodeNumbersaddEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdgesgetClassHierarchySlicer.ControlDependenceOptions getCOptions()
Slicer.ControlDependenceOptions used to construct this graph.PDG<? extends InstanceKey> getPDG(CGNode node)
java.util.Iterator<? extends Statement> iterateLazyNodes()