- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 21 for hasEdgeConnecting (0.17 sec)
-
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
} @Test public void hasEdgeConnecting_correct() { putEdge(N1, N2); assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N1, N2))).isTrue(); assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N2, N1))).isTrue(); } @Test public void hasEdgeConnecting_mismatch() { putEdge(N1, N2); assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(N1, N2))).isFalse();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV()); } @Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { checkNotNull(nodeU); checkNotNull(nodeV); return nodes().contains(nodeU) && successors(nodeU).contains(nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); if (!isOrderingCompatible(endpoints)) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.hasEdgeConnecting(node, successor)).isTrue(); assertThat(graph.incidentEdges(node)).contains(EndpointPair.of(graph, node, successor)); } for (EndpointPair<N> endpoints : sanityCheckSet(graph.incidentEdges(node))) { if (graph.isDirected()) { assertThat(graph.hasEdgeConnecting(endpoints.source(), endpoints.target())).isTrue(); } else {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void hasEdgeConnecting_disconnectedNodes() { addNode(N1); addNode(N2); assertThat(network.hasEdgeConnecting(N1, N2)).isFalse(); } @Test public void hasEdgesConnecting_nodesNotInGraph() { addNode(N1); addNode(N2); assertThat(network.hasEdgeConnecting(N1, NODE_NOT_IN_GRAPH)).isFalse();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void hasEdgeConnecting_disconnectedNodes() { addNode(N1); addNode(N2); assertThat(network.hasEdgeConnecting(N1, N2)).isFalse(); } @Test public void hasEdgesConnecting_nodesNotInGraph() { addNode(N1); addNode(N2); assertThat(network.hasEdgeConnecting(N1, NODE_NOT_IN_GRAPH)).isFalse();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}. * * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ @Override boolean hasEdgeConnecting(N nodeU, N nodeV); /** * Returns true if there is an edge that directly connects {@code endpoints} (in the order, if
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/StandardValueGraph.java
} }; return nodeInvalidatableSet(incident, node); } @Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { return hasEdgeConnectingInternal(checkNotNull(nodeU), checkNotNull(nodeV)); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); return isOrderingCompatible(endpoints)
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/BaseGraph.java
* equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}. * * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ boolean hasEdgeConnecting(N nodeU, N nodeV); /** * Returns true if there is an edge that directly connects {@code endpoints} (in the order, if
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) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
return isDirected() ? successors(node).size() : degree(node); } @Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { checkNotNull(nodeU); checkNotNull(nodeV); return nodes().contains(nodeU) && successors(nodeU).contains(nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); if (!isOrderingCompatible(endpoints)) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* endpoints are unordered and the network is directed; it simply returns {@code false}. This is * for consistency with {@link Graph#hasEdgeConnecting(EndpointPair)} and {@link * ValueGraph#hasEdgeConnecting(EndpointPair)}. * * @since 27.1 */ boolean hasEdgeConnecting(EndpointPair<N> endpoints); // // Network identity // /**
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)