Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 15 for removeEdge (0.17 sec)

  1. guava-tests/test/com/google/common/graph/ValueGraphTest.java

        assertThat(graph.removeEdge(2, 1)).isNull();
        assertThat(graph.removeEdge(2, 3)).isEqualTo("valueC");
        assertThat(graph.removeEdge(2, 3)).isNull();
      }
    
      @Test
      public void removeEdge_directed_orderMismatch() {
        graph = ValueGraphBuilder.directed().build();
        graph.putEdgeValue(1, 2, "1->2");
        graph.putEdgeValue(2, 1, "2->1");
        IllegalArgumentException e =
            assertThrows(
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Tue Feb 06 18:35:19 GMT 2024
    - 20K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/graph/AbstractNetworkTest.java

        assertThat(n2InEdges).isEmpty();
        assertThat(n2OutEdges).isEmpty();
      }
    
      @Test
      public void removeEdge_existingEdge() {
        assume().that(graphIsMutable()).isTrue();
    
        addEdge(N1, N2, E12);
        assertTrue(networkAsMutableNetwork.removeEdge(E12));
        assertFalse(networkAsMutableNetwork.removeEdge(E12));
        assertThat(networkAsMutableNetwork.edges()).doesNotContain(E12);
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Mon Jan 22 17:29:38 GMT 2024
    - 33K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java

        assertThat(n2InEdges).isEmpty();
        assertThat(n2OutEdges).isEmpty();
      }
    
      @Test
      public void removeEdge_existingEdge() {
        assume().that(graphIsMutable()).isTrue();
    
        addEdge(N1, N2, E12);
        assertTrue(networkAsMutableNetwork.removeEdge(E12));
        assertFalse(networkAsMutableNetwork.removeEdge(E12));
        assertThat(networkAsMutableNetwork.edges()).doesNotContain(E12);
    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)
  4. android/guava-tests/test/com/google/common/graph/ValueGraphTest.java

        assertThat(graph.removeEdge(2, 1)).isNull();
        assertThat(graph.removeEdge(2, 3)).isEqualTo("valueC");
        assertThat(graph.removeEdge(2, 3)).isNull();
      }
    
      @Test
      public void removeEdge_directed_orderMismatch() {
        graph = ValueGraphBuilder.directed().build();
        graph.putEdgeValue(1, 2, "1->2");
        graph.putEdgeValue(2, 1, "2->1");
        IllegalArgumentException e =
            assertThrows(
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Wed Sep 06 17:04:31 GMT 2023
    - 17.4K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java

        assertThat(graphAsMutableGraph.putEdge(N1, N1)).isFalse();
      }
    
      @Test
      public void removeEdge_antiparallelEdges() {
        assume().that(graphIsMutable()).isTrue();
    
        putEdge(N1, N2);
        putEdge(N2, N1);
    
        assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue();
        assertThat(graph.successors(N1)).isEmpty();
        assertThat(graph.predecessors(N1)).containsExactly(N2);
    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)
  6. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

      }
    
      @Test
      public void removeEdge_antiparallelEdges() {
        assume().that(graphIsMutable()).isTrue();
    
        putEdge(N1, N2);
        putEdge(N2, N1); // no-op
    
        assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue();
        assertThat(graph.adjacentNodes(N1)).isEmpty();
        assertThat(graph.edges()).isEmpty();
        assertThat(graphAsMutableGraph.removeEdge(N2, N1)).isFalse();
      }
    
      @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)
  7. android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java

      }
    
      @Test
      public void removeEdge_existingEdge() {
        assume().that(graphIsMutable()).isTrue();
    
        putEdge(N1, N2);
        assertThat(graph.successors(N1)).containsExactly(N2);
        assertThat(graph.predecessors(N2)).containsExactly(N1);
        assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue();
        assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isFalse();
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Jan 22 17:29:38 GMT 2024
    - 16.6K bytes
    - Viewed (0)
  8. guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java

        assertThat(graphAsMutableGraph.putEdge(N1, N1)).isFalse();
      }
    
      @Test
      public void removeEdge_antiparallelEdges() {
        assume().that(graphIsMutable()).isTrue();
    
        putEdge(N1, N2);
        putEdge(N2, N1);
    
        assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue();
        assertThat(graph.successors(N1)).isEmpty();
        assertThat(graph.predecessors(N1)).containsExactly(N2);
    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)
  9. guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

      }
    
      @Test
      public void removeEdge_antiparallelEdges() {
        assume().that(graphIsMutable()).isTrue();
    
        putEdge(N1, N2);
        putEdge(N2, N1); // no-op
    
        assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue();
        assertThat(graph.adjacentNodes(N1)).isEmpty();
        assertThat(graph.edges()).isEmpty();
        assertThat(graphAsMutableGraph.removeEdge(N2, N1)).isFalse();
      }
    
      @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)
  10. guava-tests/test/com/google/common/graph/AbstractGraphTest.java

      }
    
      @Test
      public void removeEdge_existingEdge() {
        assume().that(graphIsMutable()).isTrue();
    
        putEdge(N1, N2);
        assertThat(graph.successors(N1)).containsExactly(N2);
        assertThat(graph.predecessors(N2)).containsExactly(N1);
        assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue();
        assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isFalse();
    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)
Back to top