Class GraphReachability<T,S>
java.lang.Object
com.ibm.wala.util.graph.GraphReachability<T,S>
A dataflow system that computes, for each graph node, the set of "interesting" nodes that are
reachable
-
Constructor Summary
-
Method Summary
-
Constructor Details
-
GraphReachability
- Parameters:
g
- call graph to analyzefilter
- "interesting" node definition- Throws:
IllegalArgumentException
- if g is null
-
-
Method Details
-
getReachableSet
- Returns:
- the set of interesting nodes reachable from n
- Throws:
IllegalStateException
-
solve
- Returns:
- true iff the evaluation of some equation caused a change in the value of some variable.
- Throws:
CancelException
-