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.
|
com.google.javascript.jscomp.type |
Provides type-checking data structures and algorithms.
|
Class and Description |
---|
AdjacencyGraph
A minimal graph interface.
|
DiGraph
A generic directed graph.
|
DiGraph.DiGraphEdge
A generic directed graph edge.
|
DiGraph.DiGraphNode
A generic directed graph node.
|
Graph
The base generic class for graph-like data structure and algorithms in
the compiler.
|
GraphvizGraph
A graph that can be dumped to a Graphviz DOT file.
|
LinkedDirectedGraph
A directed graph using linked list within nodes to store edge information.
|
Class and Description |
---|
AdjacencyGraph
A minimal graph interface.
|
Annotatable
Object that has an annotation.
|
Annotation
Information that can be annotated to a
GraphNode or
Graph.GraphEdge . |
DiGraph
A generic directed graph.
|
DiGraph.DiGraphEdge
A generic directed graph edge.
|
DiGraph.DiGraphNode
A generic directed graph node.
|
FixedPointGraphTraversal
A utility class for doing fixed-point computations.
|
FixedPointGraphTraversal.EdgeCallback
Edge callback
|
Graph
The base generic class for graph-like data structure and algorithms in
the compiler.
|
Graph.GraphEdge
A generic edge.
|
GraphColoring
Annotates the graph with a color in a way that no connected node will have
the same color.
|
GraphNode
A generic node.
|
GraphReachability.EdgeTuple
Represents a Source Node and an Edge.
|
GraphvizGraph
A graph that can be dumped to a Graphviz DOT file.
|
GraphvizGraph.GraphvizEdge
A Graphviz edge.
|
GraphvizGraph.GraphvizNode
A Graphviz node.
|
LinkedDirectedGraph
A directed graph using linked list within nodes to store edge information.
|
LinkedDirectedGraph.LinkedDiGraphEdge
A directed graph edge that stores the source and destination nodes at each edge.
|
LinkedDirectedGraph.LinkedDiGraphNode
A directed graph node that stores outgoing edges and incoming edges as an list within the node
itself.
|
LinkedUndirectedGraph
An undirected graph using linked list within nodes to store edge
information.
|
LowestCommonAncestorFinder
Implements a lowest common ancestor search algorithm.
|
SubGraph
An interface representing a subgraph that provides adjacency calculation to
a node.
|
UndiGraph
A generic undirected graph.
|
UndiGraph.UndiGraphEdge
A generic undirected graph edge.
|
UndiGraph.UndiGraphNode
A generic undirected graph node.
|
UnionFind
Union-Find is a classical algorithm used to find connected components in
graph theory.
|
Class and Description |
---|
LatticeElement
A lattice element.
|
Copyright © 2009-2020 Google. All Rights Reserved.