- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 56 for Endpoints (0.15 sec)
-
android/guava/src/com/google/common/graph/StandardMutableNetwork.java
edgeToReferenceNode.put(edge, nodeU); return true; } @Override @CanIgnoreReturnValue public boolean addEdge(EndpointPair<N> endpoints, E edge) { validateEndpoints(endpoints); return addEdge(endpoints.nodeU(), endpoints.nodeV(), edge); } @Override @CanIgnoreReturnValue public boolean removeNode(N node) { checkNotNull(node, "node");
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
} @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); return isOrderingCompatible(endpoints) && hasEdgeConnectingInternal(endpoints.nodeU(), endpoints.nodeV()); } @Override @CheckForNull public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* Returns the value of the edge that connects {@code endpoints} (in the order, if any, specified * by {@code endpoints}), if one is present; otherwise, returns {@code defaultValue}. * * <p>If this graph is directed, the endpoints must be ordered. * * @throws IllegalArgumentException if either endpoint is not an element of this graph * @throws IllegalArgumentException if the endpoints are unordered and the graph is directed
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* order, if any, specified by {@code endpoints}). * * <p>The resulting set of edges will be parallel (i.e. have equal {@link * #incidentNodes(Object)}). If this network does not {@link #allowsParallelEdges() allow parallel * edges}, the resulting set will contain at most one edge (equivalent to {@code * edgeConnecting(endpoints).asSet()}). *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableValueGraph.java
* * <p>If either or both endpoints are not already present in this graph, this method will * silently {@link #addNode(Object) add} each missing endpoint to the graph. * * @return this {@code Builder} object * @throws IllegalArgumentException if the introduction of the edge would violate {@link * #allowsSelfLoops()} * @throws IllegalArgumentException if the endpoints are unordered and the graph is directed
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingValueGraph.java
public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { return delegate().hasEdgeConnecting(endpoints); } @Override @CheckForNull public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) { return delegate().edgeValueOrDefault(nodeU, nodeV, defaultValue); } @Override @CheckForNull public V edgeValueOrDefault(EndpointPair<N> endpoints, @CheckForNull V defaultValue) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
assume().that(graphIsMutable()).isTrue(); EndpointPair<Integer> endpoints = EndpointPair.ordered(N1, N2); IllegalArgumentException e = assertThrows( IllegalArgumentException.class, () -> networkAsMutableNetwork.addEdge(endpoints, E12)); assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } @Test public void addEdge_selfLoop_notAllowed() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 18.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
assume().that(graphIsMutable()).isTrue(); EndpointPair<Integer> endpoints = EndpointPair.unordered(N1, N2); IllegalArgumentException e = assertThrows(IllegalArgumentException.class, () -> graphAsMutableGraph.putEdge(endpoints)); assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } /**
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingGraph.java
public boolean hasEdgeConnecting(N nodeU, N nodeV) { return delegate().hasEdgeConnecting(nodeU, nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { return delegate().hasEdgeConnecting(endpoints); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
/** * Returns true if there is an edge that directly connects {@code endpoints} (in the order, if * any, specified by {@code endpoints}). This is equivalent to {@code * edges().contains(endpoints)}. * * <p>Unlike the other {@code EndpointPair}-accepting methods, this method does not throw if the * endpoints are unordered; it simply returns false. This is for consistency with the behavior of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0)