public class GraphReachability<N,E> extends Object implements FixedPointGraphTraversal.EdgeCallback<N,E>
compute(Object),
the graph nodes will be annotated with REACHABLE if it is reachable
from the specified entry node.Annotatable.getAnnotation()| Modifier and Type | Class and Description |
|---|---|
static class |
GraphReachability.EdgeTuple<N,E>
Represents Source Node, Edge and Destination Node.
|
| Modifier and Type | Field and Description |
|---|---|
static Annotation |
REACHABLE |
| Constructor and Description |
|---|
GraphReachability(DiGraph<N,E> graph) |
GraphReachability(DiGraph<N,E> graph,
com.google.common.base.Predicate<GraphReachability.EdgeTuple<N,E>> edgePredicate) |
public static final Annotation REACHABLE
public GraphReachability(DiGraph<N,E> graph, com.google.common.base.Predicate<GraphReachability.EdgeTuple<N,E>> edgePredicate)
graph - The graph.edgePredicate - Given the predecessor P of the a node S and the edge
coming from P to S, this predicate should return true if S is
reachable from P using the edge.public void compute(N entry)
public void recompute(N reachableNode)
public boolean traverseEdge(N source, E e, N destination)
FixedPointGraphTraversal.EdgeCallbacktraverseEdge in interface FixedPointGraphTraversal.EdgeCallback<N,E>source - The start node.e - The edge.destination - The end node.