Package com.google.javascript.jscomp.graph
Provides graph data structures and algorithms for coloring and fixed-point
computations.
-
Interface Summary Interface Description AdjacencyGraph<N,E> A minimal graph interface.Annotatable Object that has an annotation.Annotation Information that can be annotated to aGraphNode
orGraph.GraphEdge
.DiGraph.DiGraphEdge<N,E> A generic directed graph edge.DiGraph.DiGraphNode<N,E> A generic directed graph node.FixedPointGraphTraversal.EdgeCallback<Node,Edge> Graph.GraphEdge<N,E> A generic edge.GraphNode<N,E> A generic node.GraphvizGraph A graph that can be dumped to a Graphviz DOT file.GraphvizGraph.GraphvizEdge A Graphviz edge.GraphvizGraph.GraphvizNode A Graphviz node.LatticeElement A lattice element.SubGraph<N,E> An interface representing a subgraph that provides adjacency calculation to a node.UndiGraph.UndiGraphEdge<N,E> A generic undirected graph edge.UndiGraph.UndiGraphNode<N,E> A generic undirected graph node.UnionFind<E> Union-Find is a classical algorithm used to find connected components in graph theory. -
Class Summary Class Description DiGraph<N,E> A generic directed graph.FixedPointGraphTraversal<N,E> A utility class for doing fixed-point computations.Graph<N,E> The base generic class for graph-like data structure and algorithms in the compiler.GraphColoring<N,E> Annotates the graph with a color in a way that no connected node will have the same color.GraphColoring.Color GraphColoring.GreedyGraphColoring<N,E> Greedily assign nodes with high degree unique colors.GraphPruner<N,E> Prunes a graph, creating a new graph with nodes removed.GraphReachability<N,E> Computes all the reachable nodes.GraphReachability.EdgeTuple<N,E> Represents Source Node, Edge and Destination Node.LinkedDirectedGraph<N,E> A directed graph using linked list within nodes to store edge information.LinkedUndirectedGraph<N,E> An undirected graph using linked list within nodes to store edge information.StandardUnionFind<E> A Union-Find implementation.UndiGraph<N,E> A generic undirected graph.