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

Method predecessors

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

Returns all nodes in this graph adjacent to node which can be reached by traversing node's incoming edges against the direction (if any) of the edge. @throws IllegalArgumentException if node is not an element of this graph

(Object node)

Source from the content-addressed store, hash-verified

213 * @throws IllegalArgumentException if {@code node} is not an element of this graph
214 */
215 Set<N> predecessors(Object node);
216
217 /**
218 * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing

Callers 15

inDegreeMethod · 0.65
predecessorsMethod · 0.65
rootsMethod · 0.65
nodeConnectionsOfMethod · 0.65
createAdjacencyMapMethod · 0.65
adjacentNodesMethod · 0.65
equalMethod · 0.65
removeNodeMethod · 0.65
predecessorsMethod · 0.65
inDegreeMethod · 0.65
predecessorsMethod · 0.65
rootsMethod · 0.65

Calls

no outgoing calls

Tested by

no test coverage detected