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

Method incidentNodes

corpus/java/training/guava/graph/Network.java:254–254  ·  view source on GitHub ↗

Returns the nodes which are the endpoints of edge in this graph. For self-loop edges, the returned set's size will be 1. If the graph is plain #isDirected() directed and edge is not a self-loop, the iteration order will be [source(edge), target(edge)]. @throws Ill

(Object edge)

Source from the content-addressed store, hash-verified

252 * @throws IllegalArgumentException if {@code edge} is not an element of this graph
253 */
254 Set<N> incidentNodes(Object edge);
255
256 /**
257 * Returns the nodes which have an {@linkplain #incidentEdges(Object) incident edge}

Callers 15

oppositeNodeMethod · 0.65
parallelEdgesMethod · 0.65
copyOfMethod · 0.65
mergeEdgesFromMethod · 0.65
applyMethod · 0.65
addEdgeMethod · 0.65
oppositeNodeMethod · 0.65
parallelEdgesMethod · 0.65
copyOfMethod · 0.65
mergeEdgesFromMethod · 0.65

Calls

no outgoing calls

Tested by

no test coverage detected