Interface ISDG

All Superinterfaces:

EdgeManager<Statement>, Graph<Statement>, IClassHierarchyDweller, Iterable<Statement>, NodeManager<Statement>, NumberedEdgeManager<Statement>, NumberedGraph<Statement>, NumberedNodeManager<Statement>

All Known Implementing Classes:

CISDG, SDG

public interface ISDG
extends NumberedGraph<Statement>, IClassHierarchyDweller

Interface for an SDG (loosely defined here as a graph of Statements. This interface implies that the underlying graph is computed lazily on demand.

Method Summary

Modifier and Type	Method	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.
Iterator<? extends Statement>	iterateLazyNodes()	Iterate over the nodes which have been discovered so far, but do NOT eagerly construct the entire graph.

Methods inherited from interface EdgeManager

addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges

Methods inherited from interface Graph

removeNodeAndEdges

Methods inherited from interface IClassHierarchyDweller

getClassHierarchy

Methods inherited from interface Iterable

forEach, spliterator

Methods inherited from interface NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Methods inherited from interface NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

Methods inherited from interface NumberedNodeManager

getMaxNumber, getNode, getNumber, iterateNodes

Method Details

getCOptions

Slicer.ControlDependenceOptions getCOptions()

Slicer.ControlDependenceOptions used to construct this graph.

getPDG

PDG<? extends InstanceKey> getPDG(CGNode node)

Get the program dependence graph constructed for a particular node.

iterateLazyNodes

Iterator<? extends Statement> iterateLazyNodes()

Iterate over the nodes which have been discovered so far, but do NOT eagerly construct the entire graph.