com.google.javascript.jscomp

Class CheckPathsBetweenNodes<N,E>

java.lang.Object

com.google.javascript.jscomp.CheckPathsBetweenNodes<N,E>

Type Parameters:

N - The node type.

E - The edge type.

public final class CheckPathsBetweenNodes<N,E>
extends java.lang.Object

See constructor, #CheckPathsBetweenNodes(DiGraph, DiGraphNode, DiGraphNode, Predicate, Predicate), for a description of this algorithm.

Constructor Summary

Constructors

Constructor and Description
CheckPathsBetweenNodes(DiGraph<N,E> graph, DiGraph.DiGraphNode<N,E> a, DiGraph.DiGraphNode<N,E> b, com.google.common.base.Predicate<N> nodePredicate, com.google.common.base.Predicate<DiGraph.DiGraphEdge<N,E>> edgePredicate) Inclusive check.

Method Summary

Modifier and Type	Method and Description
boolean	allPathsSatisfyPredicate()
boolean	somePathsSatisfyPredicate()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

CheckPathsBetweenNodes

public CheckPathsBetweenNodes(DiGraph<N,E> graph,
                              DiGraph.DiGraphNode<N,E> a,
                              DiGraph.DiGraphNode<N,E> b,
                              com.google.common.base.Predicate<N> nodePredicate,
                              com.google.common.base.Predicate<DiGraph.DiGraphEdge<N,E>> edgePredicate)

Inclusive check.

Method Detail

allPathsSatisfyPredicate

public boolean allPathsSatisfyPredicate()

Returns:

true iff all paths contain at least one node that satisfy the predicate

somePathsSatisfyPredicate

public boolean somePathsSatisfyPredicate()

Returns:

true iff some paths contain at least one node that satisfy the predicate