Uses of Class
soot.toolkits.graph.HashMutableDirectedGraph

Packages that use HashMutableDirectedGraph

Package	Description
soot.jimple.toolkits.annotation.arraycheck	Classes that carry out an analysis to determine whether or not array bounds checks are necessary.
soot.jimple.toolkits.infoflow
soot.toolkits.graph	Toolkit to produce and manipulate various types of control flow graphs.

Uses of HashMutableDirectedGraph in soot.jimple.toolkits.annotation.arraycheck

Subclasses of HashMutableDirectedGraph in soot.jimple.toolkits.annotation.arraycheck

Modifier and Type	Class	Description
class	ExtendedHashMutableDirectedGraph<N>	add skipNode method to direct all predecessor edges to successors.

Uses of HashMutableDirectedGraph in soot.jimple.toolkits.infoflow

Methods in soot.jimple.toolkits.infoflow that return HashMutableDirectedGraph

Modifier and Type	Method	Description
protected HashMutableDirectedGraph<EquivalentValue>	InfoFlowAnalysis.getInvokeInfoFlowSummary(InvokeExpr ie, Stmt is, SootMethod context)
HashMutableDirectedGraph<EquivalentValue>	SmartMethodInfoFlowAnalysis.getMethodAbbreviatedInfoFlowGraph()
HashMutableDirectedGraph<EquivalentValue>	ClassInfoFlowAnalysis.getMethodInfoFlowSummary(SootMethod method, boolean doFullAnalysis)
HashMutableDirectedGraph<EquivalentValue>	InfoFlowAnalysis.getMethodInfoFlowSummary(SootMethod sm)	Returns a BACKED MutableDirectedGraph whose nodes are EquivalentValue wrapped Refs.
HashMutableDirectedGraph<EquivalentValue>	InfoFlowAnalysis.getMethodInfoFlowSummary(SootMethod sm, boolean doFullAnalysis)
HashMutableDirectedGraph<EquivalentValue>	SmartMethodInfoFlowAnalysis.getMethodInfoFlowSummary()
HashMutableDirectedGraph<EquivalentValue>	ClassInfoFlowAnalysis.triviallyConservativeInfoFlowAnalysis(SootMethod sm)	Does not require the method to have a body

Uses of HashMutableDirectedGraph in soot.toolkits.graph

Subclasses of HashMutableDirectedGraph in soot.toolkits.graph

Modifier and Type	Class	Description
class	HashReversibleGraph<N>	A reversible version of HashMutableDirectedGraph
class	MemoryEfficientGraph<N>	A memory efficient version of HashMutableDirectedGraph, in the sense that throw-away objects passed as arguments will not be kept in the process of adding edges.

Constructors in soot.toolkits.graph with parameters of type HashMutableDirectedGraph

Constructor	Description
HashMutableDirectedGraph(HashMutableDirectedGraph<N> orig)