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.
|
Modifier and Type | Class and Description |
---|---|
(package private) class |
AmbiguateProperties.PropertyGraphNode |
Modifier and Type | Method and Description |
---|---|
GraphNode<NameReferenceGraph.Name,NameReferenceGraph.Reference> |
NameReferenceGraph.createNode(NameReferenceGraph.Name value) |
GraphNode<AmbiguateProperties.Property,java.lang.Void> |
AmbiguateProperties.PropertyGraph.getNode(AmbiguateProperties.Property property) |
Modifier and Type | Interface and Description |
---|---|
static interface |
DiGraph.DiGraphNode<N,E>
A generic directed graph node.
|
static interface |
UndiGraph.UndiGraphNode<N,E>
A generic undirected graph node.
|
Modifier and Type | Class and Description |
---|---|
(package private) static class |
LinkedDirectedGraph.AnnotatedLinkedDirectedGraphNode<N,E>
A directed graph node with annotations.
|
static class |
LinkedDirectedGraph.LinkedDirectedGraphNode<N,E>
A directed graph node that stores outgoing edges and incoming edges as an
list within the node itself.
|
(package private) static class |
LinkedUndirectedGraph.AnnotatedLinkedUndirectedGraphNode<N,E>
An undirected graph node with annotations.
|
(package private) static class |
LinkedUndirectedGraph.LinkedUndirectedGraphNode<N,E>
An undirected graph node that stores outgoing edges and incoming edges as
an list within the node itself.
|
Modifier and Type | Field and Description |
---|---|
private java.util.List<GraphNode<N,E>> |
Graph.SimpleSubGraph.nodes |
Modifier and Type | Method and Description |
---|---|
(package private) <T extends GraphNode<N,E>> |
Graph.getNodeOrFail(N val)
Gets the node of the specified type, or throws an
IllegalArgumentException.
|
Modifier and Type | Method and Description |
---|---|
GraphNode<N,E> |
LinkedUndirectedGraph.createNode(N value) |
GraphNode<N,E> |
LinkedDirectedGraph.createNode(N value) |
abstract GraphNode<N,E> |
Graph.createNode(N value)
Gets a node from the graph given a value.
|
GraphNode<N,E> |
LinkedUndirectedGraph.getNode(N value) |
GraphNode<N,E> |
AdjacencyGraph.getNode(N value)
Gets a node from the graph given a value.
|
GraphNode<N,E> |
LinkedDirectedGraph.getNode(N nodeValue) |
GraphNode<N,E> |
LinkedUndirectedGraph.LinkedUndirectedGraphEdge.getNodeA() |
GraphNode<N,E> |
LinkedDirectedGraph.LinkedDirectedGraphEdge.getNodeA() |
GraphNode<N,E> |
Graph.GraphEdge.getNodeA() |
GraphNode<N,E> |
LinkedUndirectedGraph.LinkedUndirectedGraphEdge.getNodeB() |
GraphNode<N,E> |
LinkedDirectedGraph.LinkedDirectedGraphEdge.getNodeB() |
GraphNode<N,E> |
Graph.GraphEdge.getNodeB() |
Modifier and Type | Method and Description |
---|---|
java.util.List<GraphNode<N,E>> |
LinkedUndirectedGraph.getNeighborNodes(N value) |
java.util.List<GraphNode<N,E>> |
LinkedDirectedGraph.getNeighborNodes(N value) |
abstract java.util.List<GraphNode<N,E>> |
Graph.getNeighborNodes(N value)
Gets the neighboring nodes.
|
java.util.Collection<GraphNode<N,E>> |
LinkedUndirectedGraph.getNodes() |
java.util.Collection<? extends GraphNode<N,E>> |
AdjacencyGraph.getNodes()
Gets an immutable list of all nodes.
|
abstract java.util.Collection<? extends GraphNode<N,E>> |
Graph.getNodes()
Gets an immutable list of all nodes.
|
private java.util.List<GraphNode<N,E>> |
LinkedUndirectedGraph.LinkedUndirectedGraphNode.neighborList() |