MCPcopy Index your code
hub / github.com/antlr/codebuff / successors

Method successors

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

Returns all nodes in this graph adjacent to node which can be reached by traversing node's outgoing edges in the direction (if any) of the edge. This is not the same as "all nodes reachable from node by following outgoing edges" (also known as node's transi

(Object node)

Source from the content-addressed store, hash-verified

224 * @throws IllegalArgumentException if {@code node} is not an element of this graph
225 */
226 Set<N> successors(Object node);
227
228 //
229 // Element-level queries

Callers 15

outDegreeMethod · 0.65
successorsMethod · 0.65
isSubgraphCyclicMethod · 0.65
nodeConnectionsOfMethod · 0.65
createAdjacencyMapMethod · 0.65
adjacentNodesMethod · 0.65
copyOfMethod · 0.65
equalMethod · 0.65
adjacentNodesStringMethod · 0.65
addEdgeMethod · 0.65
addEdgeMethod · 0.65
removeNodeMethod · 0.65

Calls

no outgoing calls

Tested by

no test coverage detected