Uses of Class
com.google.javascript.jscomp.graph.DiGraph

Packages that use DiGraph

Package	Description
com.google.javascript.jscomp
com.google.javascript.jscomp.graph

Uses of DiGraph in com.google.javascript.jscomp

Subclasses of DiGraph in com.google.javascript.jscomp

Modifier and Type	Class	Description
class	ControlFlowGraph<N>	Control flow graph.

Uses of DiGraph in com.google.javascript.jscomp.graph

Subclasses of DiGraph in com.google.javascript.jscomp.graph

Modifier and Type	Class	Description
class	LinkedDirectedGraph<N,E>	A directed graph using ArrayLists within nodes to store edge information.

Methods in com.google.javascript.jscomp.graph with parameters of type DiGraph

Modifier and Type	Method	Description
void	FixedPointGraphTraversal.computeFixedPoint(DiGraph<N,E> graph)	Compute a fixed point for the given graph.
void	FixedPointGraphTraversal.computeFixedPoint(DiGraph<N,E> graph, Set<N> entrySet)	Compute a fixed point for the given graph, entering from the given nodes.
void	FixedPointGraphTraversal.computeFixedPoint(DiGraph<N,E> graph, N entry)	Compute a fixed point for the given graph, entering from the given node.
LowestCommonAncestorFinder<N,E>	LowestCommonAncestorFinder.Factory.create(DiGraph<N,E> graph)

Constructors in com.google.javascript.jscomp.graph with parameters of type DiGraph

Modifier	Constructor	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.
	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, boolean inclusive)	Given a graph G with nodes A and B, this algorithm determines if all paths from A to B contain at least one node satisfying a given predicate.
	GraphReachability(DiGraph<N,E> graph)
	GraphReachability(DiGraph<N,E> graph, @Nullable com.google.common.base.Predicate<GraphReachability.EdgeTuple<N,E>> edgePredicate)
	LowestCommonAncestorFinder(DiGraph<N,E> graph)