Uses of Interface
com.google.javascript.jscomp.graph.DiGraph.DiGraphNode

Packages that use DiGraph.DiGraphNode

Package	Description
com.google.javascript.jscomp	Provides the core compiler and its public API.
com.google.javascript.jscomp.graph	Provides graph data structures and algorithms for coloring and fixed-point computations.

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

Methods in com.google.javascript.jscomp that return DiGraph.DiGraphNode

Modifier and Type	Method and Description
DiGraph.DiGraphNode<N,ControlFlowGraph.Branch>	ControlFlowGraph.getEntry() Gets the entry point of the control flow graph.
DiGraph.DiGraphNode<N,ControlFlowGraph.Branch>	ControlFlowGraph.getImplicitReturn() Gets the implicit return node.

Methods in com.google.javascript.jscomp that return types with arguments of type DiGraph.DiGraphNode

Modifier and Type	Method and Description
Comparator<DiGraph.DiGraphNode<N,ControlFlowGraph.Branch>>	ControlFlowGraph.getOptionalNodeComparator(boolean isForward) Gets a comparator for the nodes.

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

Modifier and Type	Method and Description
boolean	ControlFlowGraph.isImplicitReturn(DiGraph.DiGraphNode<N,ControlFlowGraph.Branch> node) Checks whether node is the implicit return.

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

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.
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.

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

Methods in com.google.javascript.jscomp.graph that return DiGraph.DiGraphNode

Modifier and Type	Method and Description
DiGraph.DiGraphNode<N,E>	LinkedDirectedGraph.createDirectedGraphNode(N nodeValue)
abstract DiGraph.DiGraphNode<N,E>	DiGraph.createDirectedGraphNode(N nodeValue)
DiGraph.DiGraphNode<N,E>	DiGraph.DiGraphEdge.getDestination()
DiGraph.DiGraphNode<N,E>	LinkedDirectedGraph.getDirectedGraphNode(N nodeValue)
abstract DiGraph.DiGraphNode<N,E>	DiGraph.getDirectedGraphNode(N nodeValue)
DiGraph.DiGraphNode<N,E>	DiGraph.DiGraphEdge.getSource()

Methods in com.google.javascript.jscomp.graph that return types with arguments of type DiGraph.DiGraphNode

Modifier and Type	Method and Description
Iterable<DiGraph.DiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedGraphNodes()
abstract Iterable<DiGraph.DiGraphNode<N,E>>	DiGraph.getDirectedGraphNodes() Gets an immutable iterable over all the nodes in the graph.
List<DiGraph.DiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedPredNodes(DiGraph.DiGraphNode<N,E> dNode)
abstract List<DiGraph.DiGraphNode<N,E>>	DiGraph.getDirectedPredNodes(DiGraph.DiGraphNode<N,E> n)
List<DiGraph.DiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedPredNodes(N nodeValue)
abstract List<DiGraph.DiGraphNode<N,E>>	DiGraph.getDirectedPredNodes(N nodeValue)
List<DiGraph.DiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedSuccNodes(DiGraph.DiGraphNode<N,E> dNode)
abstract List<DiGraph.DiGraphNode<N,E>>	DiGraph.getDirectedSuccNodes(DiGraph.DiGraphNode<N,E> n)
List<DiGraph.DiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedSuccNodes(N nodeValue)
abstract List<DiGraph.DiGraphNode<N,E>>	DiGraph.getDirectedSuccNodes(N nodeValue)
Collection<DiGraph.DiGraphNode<N,E>>	LinkedDirectedGraph.getNodes()

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

Modifier and Type	Method and Description
List<DiGraph.DiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedPredNodes(DiGraph.DiGraphNode<N,E> dNode)
abstract List<DiGraph.DiGraphNode<N,E>>	DiGraph.getDirectedPredNodes(DiGraph.DiGraphNode<N,E> n)
List<DiGraph.DiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedSuccNodes(DiGraph.DiGraphNode<N,E> dNode)
abstract List<DiGraph.DiGraphNode<N,E>>	DiGraph.getDirectedSuccNodes(DiGraph.DiGraphNode<N,E> n)
List<GraphNode<N,E>>	LinkedDirectedGraph.getNeighborNodes(DiGraph.DiGraphNode<N,E> node)
void	DiGraph.DiGraphEdge.setDestination(DiGraph.DiGraphNode<N,E> node)
void	DiGraph.DiGraphEdge.setSource(DiGraph.DiGraphNode<N,E> node)