Package | Description |
---|---|
com.google.javascript.jscomp.graph |
Provides graph data structures and algorithms for coloring and fixed-point
computations.
|
Modifier and Type | Class and Description |
---|---|
(package private) static class |
LinkedUndirectedGraph.AnnotatedLinkedUndirectedGraphEdge<N,E>
An annotated undirected graph edge..
|
(package private) static class |
LinkedUndirectedGraph.LinkedUndirectedGraphEdge<N,E>
An undirected graph edge that stores two nodes at each edge.
|
Modifier and Type | Field and Description |
---|---|
private java.util.List<UndiGraph.UndiGraphEdge<N,E>> |
LinkedUndirectedGraph.LinkedUndirectedGraphNode.neighborEdges |
Modifier and Type | Method and Description |
---|---|
java.util.List<UndiGraph.UndiGraphEdge<N,E>> |
LinkedUndirectedGraph.LinkedUndirectedGraphNode.getNeighborEdges() |
java.util.List<UndiGraph.UndiGraphEdge<N,E>> |
UndiGraph.UndiGraphNode.getNeighborEdges() |
java.util.Iterator<UndiGraph.UndiGraphEdge<N,E>> |
LinkedUndirectedGraph.LinkedUndirectedGraphNode.getNeighborEdgesIterator() |
java.util.Iterator<UndiGraph.UndiGraphEdge<N,E>> |
UndiGraph.UndiGraphNode.getNeighborEdgesIterator() |
java.util.List<UndiGraph.UndiGraphEdge<N,E>> |
LinkedUndirectedGraph.getUndirectedGraphEdges(N n1,
N n2) |
(package private) abstract java.util.List<UndiGraph.UndiGraphEdge<N,E>> |
UndiGraph.getUndirectedGraphEdges(N n1,
N n2) |