Package com.google.javascript.jscomp.graph

Interface Summary

Interface	Description
AdjacencyGraph<N,E>	A minimal graph interface.
Annotatable	Object that has an annotation.
Annotation	Information that can be annotated to a GraphNode or Graph.GraphEdge.
DiGraph.DiGraphEdge<N,E>	A generic directed graph edge.
DiGraph.DiGraphNode<N,E>	A generic directed graph node.
FixedPointGraphTraversal.EdgeCallback<NodeT,EdgeT>	Edge callback
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.
LowestCommonAncestorFinder.Factory<N,E>	An abstraction for LowestCommonAncestorFinder::new.
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
CheckPathsBetweenNodes<N,E>	See constructor, CheckPathsBetweenNodes(DiGraph, DiGraphNode, DiGraphNode, Predicate, Predicate), for a description of this algorithm.
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	The color of a node
GraphColoring.GreedyGraphColoring<N,E>	Greedily assign nodes with high degree unique colors.
GraphReachability<N,E>	Computes all the reachable nodes.
GraphReachability.EdgeTuple<N,E>	Represents a Source Node and an Edge.
LinkedDirectedGraph<N,E>	A directed graph using ArrayLists within nodes to store edge information.
LinkedDirectedGraph.LinkedDiGraphEdge<N,E>	A directed graph edge that stores the source and destination nodes at each edge.
LinkedDirectedGraph.LinkedDiGraphNode<N,E>	A directed graph node that stores outgoing edges and incoming edges as an list within the node itself.
LinkedUndirectedGraph<N,E>	An undirected graph using linked list within nodes to store edge information.
LowestCommonAncestorFinder<N,E>	Implements a lowest common ancestor search algorithm.
StandardUnionFind<E>	A Union-Find implementation.
UndiGraph<N,E>	A generic undirected graph.