Package com.google.javascript.jscomp.graph

Interface DiGraph.DiGraphNode<N,E>

Type Parameters:

N - Value type that the graph node stores.

E - Value type that the graph edge stores.

All Superinterfaces:

Annotatable, GraphNode<N,E>

All Known Implementing Classes:

LinkedDirectedGraph.LinkedDiGraphNode

Enclosing class:

DiGraph<N,E>

public static interface DiGraph.DiGraphNode<N,E>
extends GraphNode<N,E>

A generic directed graph node.

Method Summary

Modifier and Type	Method	Description
List<? extends DiGraph.DiGraphEdge<N,E>>	getInEdges()
List<? extends DiGraph.DiGraphEdge<N,E>>	getOutEdges()
int	getPriority()	Returns a nonnegative integer priority which can be used to order nodes.
boolean	hasPriority()	Returns whether a priority has been set.
void	setPriority(int priority)	Sets a node priority, must be non-negative.

Methods inherited from interface com.google.javascript.jscomp.graph.Annotatable

getAnnotation, setAnnotation

Methods inherited from interface com.google.javascript.jscomp.graph.GraphNode

getValue

Method Details

getOutEdges

List<? extends DiGraph.DiGraphEdge<N,E>> getOutEdges()

getInEdges

List<? extends DiGraph.DiGraphEdge<N,E>> getInEdges()

hasPriority

boolean hasPriority()

Returns whether a priority has been set.

getPriority

int getPriority()

Returns a nonnegative integer priority which can be used to order nodes.

Throws if a priority has not been set.

setPriority

void setPriority(int priority)

Sets a node priority, must be non-negative.