Uses of Class
com.google.javascript.jscomp.graph.LinkedDirectedGraph.LinkedDiGraphNode

Packages that use LinkedDirectedGraph.LinkedDiGraphNode

Package	Description
com.google.javascript.jscomp.graph	Provides graph data structures and algorithms for coloring and fixed-point computations.

Uses of LinkedDirectedGraph.LinkedDiGraphNode in com.google.javascript.jscomp.graph

Fields in com.google.javascript.jscomp.graph with type parameters of type LinkedDirectedGraph.LinkedDiGraphNode

Modifier and Type	Field and Description
protected java.util.Map<N,LinkedDirectedGraph.LinkedDiGraphNode<N,E>>	LinkedDirectedGraph.nodes

Methods in com.google.javascript.jscomp.graph that return LinkedDirectedGraph.LinkedDiGraphNode

Modifier and Type	Method and Description
LinkedDirectedGraph.LinkedDiGraphNode<N,E>	LinkedDirectedGraph.createNode(N nodeValue)
LinkedDirectedGraph.LinkedDiGraphNode<N,E>	LinkedDirectedGraph.LinkedDiGraphEdge.getDestination()
LinkedDirectedGraph.LinkedDiGraphNode<N,E>	LinkedDirectedGraph.getNode(N nodeValue)
LinkedDirectedGraph.LinkedDiGraphNode<N,E>	LinkedDirectedGraph.LinkedDiGraphEdge.getSource()

Methods in com.google.javascript.jscomp.graph that return types with arguments of type LinkedDirectedGraph.LinkedDiGraphNode

Modifier and Type	Method and Description
java.util.List<LinkedDirectedGraph.LinkedDiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedPredNodes(DiGraph.DiGraphNode<N,E> dNode)
java.util.List<LinkedDirectedGraph.LinkedDiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedPredNodes(N nodeValue)
java.util.List<LinkedDirectedGraph.LinkedDiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedSuccNodes(DiGraph.DiGraphNode<N,E> dNode)
java.util.List<LinkedDirectedGraph.LinkedDiGraphNode<N,E>>	LinkedDirectedGraph.getDirectedSuccNodes(N nodeValue)
java.util.Collection<LinkedDirectedGraph.LinkedDiGraphNode<N,E>>	LinkedDirectedGraph.getNodes()

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

Modifier and Type	Method and Description
boolean	LinkedDirectedGraph.isConnectedInDirection(LinkedDirectedGraph.LinkedDiGraphNode<N,E> source, com.google.common.base.Predicate<E> edgeFilter, LinkedDirectedGraph.LinkedDiGraphNode<N,E> dest) DiGraphNode look ups can be expensive for a large graph operation, prefer this method if you have the DiGraphNodes available.
boolean	LinkedDirectedGraph.isConnectedInDirection(LinkedDirectedGraph.LinkedDiGraphNode<N,E> source, com.google.common.base.Predicate<E> edgeFilter, LinkedDirectedGraph.LinkedDiGraphNode<N,E> dest) DiGraphNode look ups can be expensive for a large graph operation, prefer this method if you have the DiGraphNodes available.