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.
|
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.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<DiGraph.DiGraphEdge<N,E>> |
LinkedDirectedGraph.getDirectedGraphEdges(N n1,
N n2) |
abstract java.util.List<DiGraph.DiGraphEdge<N,E>> |
DiGraph.getDirectedGraphEdges(N n1,
N n2) |
java.util.List<DiGraph.DiGraphEdge<N,E>> |
LinkedDirectedGraph.getEdges() |
java.util.List<DiGraph.DiGraphEdge<N,E>> |
LinkedDirectedGraph.getEdges(N n1,
N n2) |
java.util.List<DiGraph.DiGraphEdge<N,E>> |
LinkedDirectedGraph.LinkedDirectedGraphNode.getInEdges() |
java.util.List<DiGraph.DiGraphEdge<N,E>> |
DiGraph.DiGraphNode.getInEdges() |
java.util.List<DiGraph.DiGraphEdge<N,E>> |
LinkedDirectedGraph.getInEdges(N nodeValue) |
abstract java.util.List<DiGraph.DiGraphEdge<N,E>> |
DiGraph.getInEdges(N nodeValue)
Gets an immutable list of in edges of the given node.
|
java.util.List<DiGraph.DiGraphEdge<N,E>> |
LinkedDirectedGraph.LinkedDirectedGraphNode.getOutEdges() |
java.util.List<DiGraph.DiGraphEdge<N,E>> |
DiGraph.DiGraphNode.getOutEdges() |
java.util.List<DiGraph.DiGraphEdge<N,E>> |
LinkedDirectedGraph.getOutEdges(N nodeValue) |
abstract java.util.List<DiGraph.DiGraphEdge<N,E>> |
DiGraph.getOutEdges(N nodeValue)
Gets an immutable list of out edges of the given node.
|
Copyright © 2009-2019 Google. All Rights Reserved.