Uses of Interface
com.google.javascript.jscomp.graph.GraphNode

Packages that use GraphNode

Package	Description
com.google.javascript.jscomp.graph	Provides graph data structures and algorithms for coloring and fixed-point computations.

Uses of GraphNode in com.google.javascript.jscomp.graph

Subinterfaces of GraphNode in com.google.javascript.jscomp.graph

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.

Classes in com.google.javascript.jscomp.graph that implement GraphNode

Modifier and Type	Class and Description
static class	LinkedDirectedGraph.LinkedDirectedGraphNode<N,E> A directed graph node that stores outgoing edges and incoming edges as an list within the node itself.

Methods in com.google.javascript.jscomp.graph that return GraphNode

Modifier and Type	Method and Description
GraphNode<N,E>	LinkedUndirectedGraph.createNode(N value)
abstract GraphNode<N,E>	Graph.createNode(N value) Gets a node from the graph given a value.
GraphNode<N,E>	LinkedDirectedGraph.getNode(N nodeValue)
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>	Graph.GraphEdge.getNodeA()
GraphNode<N,E>	Graph.GraphEdge.getNodeB()

Methods in com.google.javascript.jscomp.graph that return types with arguments of type GraphNode

Modifier and Type	Method and Description
java.util.List<GraphNode<N,E>>	LinkedDirectedGraph.getNeighborNodes(N value)
java.util.List<GraphNode<N,E>>	LinkedUndirectedGraph.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.