Class GraphReachability<T,​S>


  • public class GraphReachability<T,​S>
    extends java.lang.Object
    A dataflow system that computes, for each graph node, the set of "interesting" nodes that are reachable
    • Constructor Detail

      • GraphReachability

        public GraphReachability​(Graph<T> g,
                                 java.util.function.Predicate<? super T> filter)
        Parameters:
        g - call graph to analyze
        filter - "interesting" node definition
        Throws:
        java.lang.IllegalArgumentException - if g is null
    • Method Detail

      • getReachableSet

        public OrdinalSet<S> getReachableSet​(java.lang.Object n)
                                      throws java.lang.IllegalStateException
        Returns:
        the set of interesting nodes reachable from n
        Throws:
        java.lang.IllegalStateException