MCPcopy Create free account
hub / github.com/antlr/codebuff / adjacentNodes

Method adjacentNodes

corpus/java/training/guava/graph/Graph.java:207–207  ·  view source on GitHub ↗

Returns the nodes which have an incident edge in common with node in this graph. @throws IllegalArgumentException if node is not an element of this graph

(Object node)

Source from the content-addressed store, hash-verified

205 * @throws IllegalArgumentException if {@code node} is not an element of this graph
206 */
207 Set<N> adjacentNodes(Object node);
208
209 /**
210 * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing

Callers 15

degreeMethod · 0.65
adjacentNodesMethod · 0.65
nodeConnectionsOfMethod · 0.65
createAdjacencyMapMethod · 0.65
applyMethod · 0.65
predecessorsMethod · 0.65
successorsMethod · 0.65
adjacentNodesMethod · 0.65
degreeMethod · 0.65
adjacentNodesMethod · 0.65
nodeConnectionsOfMethod · 0.65
createAdjacencyMapMethod · 0.65

Calls

no outgoing calls

Tested by

no test coverage detected