public class ClassReferenceGraph extends Object
isReachable(String) for a class to check whether the class is reachable from the entry point
classes (reachability). The graph's nodes and edges are defined as follows:
Nodes are fully-qualified class names, returned from ClassFile.getBinaryName() and
Symbol.getClassBinaryName() in symbolReferenceMaps.
Edges are references between two classes. When ClassA has a reference to ClassB, a directed edge from ClassA to ClassB exists in the graph. Edges in the
graph are anonymous with no attribute. Because self-loops and parallel edges are unnecessary for
reachability checks, they are not constructed.
| Modifier and Type | Method and Description |
|---|---|
boolean |
isReachable(String className)
Returns true if
className is reachable from one of classes in entryPoints in
the graph. |
public boolean isReachable(String className)
className is reachable from one of classes in entryPoints in
the graph.Copyright © 2018–2021 Google LLC.. All rights reserved.