- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 27 for removeNode (0.18 sec)
-
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } @Test public void removeNode_existingNodeWithSelfLoopEdge() { assume().that(graphIsMutable()).isTrue(); assume().that(graph.allowsSelfLoops()).isTrue(); addNode(N1); putEdge(N1, N1); assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); assertThat(graph.nodes()).isEmpty(); } @Test
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) -
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void removeNode_existingNode() { assume().that(graphIsMutable()).isTrue(); addEdge(N1, N2, E12); addEdge(N4, N1, E41); assertTrue(networkAsMutableNetwork.removeNode(N1)); assertFalse(networkAsMutableNetwork.removeNode(N1)); assertThat(networkAsMutableNetwork.nodes()).containsExactly(N2, N4);
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 removeNode_existingNode() { assume().that(graphIsMutable()).isTrue(); addEdge(N1, N2, E12); addEdge(N4, N1, E41); assertTrue(networkAsMutableNetwork.removeNode(N1)); assertFalse(networkAsMutableNetwork.removeNode(N1)); assertThat(networkAsMutableNetwork.nodes()).containsExactly(N2, N4);
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/collect/LinkedListMultimap.java
/** * Removes the specified node from the linked list. This method is only intended to be used from * the {@code Iterator} classes. See also {@link LinkedListMultimap#removeAllNodes(Object)}. */ private void removeNode(Node<K, V> node) { if (node.previous != null) { node.previous.next = node.next; } else { // node was head head = node.next; } if (node.next != null) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assertThat(graphAsMutableGraph.removeEdge(N2, N1)).isFalse(); } @Test public void removeNode_existingNodeWithSelfLoopEdge() { assume().that(graphIsMutable()).isTrue(); assume().that(graph.allowsSelfLoops()).isTrue(); addNode(N1); putEdge(N1, N1); assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); assertThat(graph.nodes()).isEmpty(); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } @Test public void removeNode_existingNodeWithSelfLoopEdge() { assume().that(graphIsMutable()).isTrue(); assume().that(graph.allowsSelfLoops()).isTrue(); addNode(N1); putEdge(N1, N1); assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); assertThat(graph.nodes()).isEmpty(); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assertThat(graphAsMutableGraph.removeEdge(N2, N1)).isFalse(); } @Test public void removeNode_existingNodeWithSelfLoopEdge() { assume().that(graphIsMutable()).isTrue(); assume().that(graph.allowsSelfLoops()).isTrue(); addNode(N1); putEdge(N1, N1); assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); assertThat(graph.nodes()).isEmpty(); } @Test
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-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} @Test public void removeNode_existingNodeWithSelfLoopEdge() { assume().that(graphIsMutable()).isTrue(); assume().that(network.allowsSelfLoops()).isTrue(); addNode(N1); addEdge(N1, N1, E11); assertThat(networkAsMutableNetwork.removeNode(N1)).isTrue(); assertThat(network.nodes()).isEmpty();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableGraph.java
* Removes {@code node} if it is present; all edges incident to {@code node} will also be removed. * * @return {@code true} if the graph was modified as a result of this call */ @CanIgnoreReturnValue boolean removeNode(N node); /** * Removes the edge connecting {@code nodeU} to {@code nodeV}, if it is present. * * @return {@code true} if the graph was modified as a result of this call */ @CanIgnoreReturnValue
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
} @Test public void removeNode_existingNodeWithSelfLoopEdge() { assume().that(graphIsMutable()).isTrue(); assume().that(network.allowsSelfLoops()).isTrue(); addNode(N1); addEdge(N1, N1, E11); assertThat(networkAsMutableNetwork.removeNode(N1)).isTrue(); assertThat(network.nodes()).isEmpty();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 19.3K bytes - Viewed (0)