- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for adjacentEdges (0.05 sec)
-
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
addEdge(N1, N2, E12); Set<String> adjacentEdges = network.adjacentEdges(E12); try { adjacentEdges.add(E23); fail(ERROR_MODIFIABLE_COLLECTION); } catch (UnsupportedOperationException e) { addEdge(N2, N3, E23); assertThat(network.adjacentEdges(E12)).containsExactlyElementsIn(adjacentEdges); } } @Override @Test
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 30 17:09:51 UTC 2025 - 19K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public int outDegree(N node) { return isDirected() ? outEdges(node).size() : degree(node); } @Override public Set<E> adjacentEdges(E edge) { EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network. Set<E> endpointPairIncidentEdges =
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Feb 19 21:24:11 UTC 2025 - 10K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
} }; return nodeInvalidatableSet(incident, node); } @Override public Set<EndpointPair<N>> adjacentEdges(EndpointPair<N> edge) { checkArgument(edges().contains(edge)); N nodeU = edge.nodeU(); N nodeV = edge.nodeV(); Set<EndpointPair<N>> endpointPairIncidentEdges =Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 07 15:57:03 UTC 2025 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public int outDegree(N node) { return isDirected() ? outEdges(node).size() : degree(node); } @Override public Set<E> adjacentEdges(E edge) { EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network. Set<E> endpointPairIncidentEdges =
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Feb 19 21:24:11 UTC 2025 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* behavior is undefined * </ul> * * @throws IllegalArgumentException if {@code edge} is not an element of this network */ Set<E> adjacentEdges(E edge); /** * Returns a live view of the set of edges that each directly connect {@code nodeU} to {@code * nodeV}. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 07 15:57:03 UTC 2025 - 17.7K bytes - Viewed (0)