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 | Class and Description |
---|---|
static class |
LinkedDirectedGraph.LinkedDiGraphEdge<N,E>
A directed graph edge that stores the source and destination nodes at each edge.
|
Modifier and Type | Method and Description |
---|---|
abstract java.util.List<? extends DiGraph.DiGraphEdge<N,E>> |
DiGraph.getEdges() |
abstract java.util.List<? extends DiGraph.DiGraphEdge<N,E>> |
DiGraph.getEdges(N n1,
N n2) |
abstract java.util.List<? extends DiGraph.DiGraphEdge<N,E>> |
DiGraph.getEdgesInDirection(N n1,
N n2) |
java.util.List<? extends DiGraph.DiGraphEdge<N,E>> |
DiGraph.DiGraphNode.getInEdges() |
abstract java.util.List<? extends DiGraph.DiGraphEdge<N,E>> |
DiGraph.getInEdges(N nodeValue)
Gets an immutable list of in edges of the given node.
|
java.util.List<? extends DiGraph.DiGraphEdge<N,E>> |
DiGraph.DiGraphNode.getOutEdges() |
abstract java.util.List<? extends DiGraph.DiGraphEdge<N,E>> |
DiGraph.getOutEdges(N nodeValue)
Gets an immutable list of out edges of the given node.
|
Copyright © 2009-2020 Google. All Rights Reserved.