removeEdge - Code Search

android/guava-tests/test/com/google/common/graph/GraphMutationTest.java

      Collections.shuffle(edgeList, gen);
      int numEdgesToRemove = gen.nextInt(NUM_EDGES);
      for (int i = 0; i < numEdgesToRemove; ++i) {
        EndpointPair<Integer> edge = edgeList.get(i);
        assertThat(graph.removeEdge(edge.nodeU(), edge.nodeV())).isTrue();
      }

      assertThat(graph.nodes()).hasSize(NUM_NODES);
      assertThat(graph.edges()).hasSize(NUM_EDGES - numEdgesToRemove);
      AbstractGraphTest.validateGraph(graph);

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Fri Aug 18 16:17:46 UTC 2017

- 4.2K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java

      Collections.shuffle(edgeList, gen);
      int numEdgesToRemove = gen.nextInt(NUM_EDGES);
      for (int i = 0; i < numEdgesToRemove; ++i) {
        Object edge = edgeList.get(i);
        assertThat(network.removeEdge(edge)).isTrue();
      }

      assertThat(network.nodes()).hasSize(NUM_NODES);
      assertThat(network.edges()).hasSize(NUM_EDGES - numEdgesToRemove);
      AbstractNetworkTest.validateNetwork(network);

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Wed Apr 10 19:42:18 UTC 2024

- 4.5K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/GraphMutationTest.java

      Collections.shuffle(edgeList, gen);
      int numEdgesToRemove = gen.nextInt(NUM_EDGES);
      for (int i = 0; i < numEdgesToRemove; ++i) {
        EndpointPair<Integer> edge = edgeList.get(i);
        assertThat(graph.removeEdge(edge.nodeU(), edge.nodeV())).isTrue();
      }

      assertThat(graph.nodes()).hasSize(NUM_NODES);
      assertThat(graph.edges()).hasSize(NUM_EDGES - numEdgesToRemove);
      AbstractGraphTest.validateGraph(graph);

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Fri Aug 18 16:17:46 UTC 2017

- 4.2K bytes

- Viewed (0)

github.com/google/guava

guava/src/com/google/common/graph/MutableNetwork.java

  /**
   * Removes {@code edge} from this network, if it is present.
   *
   * @return {@code true} if the network was modified as a result of this call
   */
  @CanIgnoreReturnValue
  boolean removeEdge(E edge);

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Mon Apr 26 17:43:39 UTC 2021

- 4.4K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/NetworkMutationTest.java

      Collections.shuffle(edgeList, gen);
      int numEdgesToRemove = gen.nextInt(NUM_EDGES);
      for (int i = 0; i < numEdgesToRemove; ++i) {
        Object edge = edgeList.get(i);
        assertThat(network.removeEdge(edge)).isTrue();
      }

      assertThat(network.nodes()).hasSize(NUM_NODES);
      assertThat(network.edges()).hasSize(NUM_EDGES - numEdgesToRemove);
      AbstractNetworkTest.validateNetwork(network);

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Wed Apr 10 19:42:18 UTC 2024

- 4.5K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/graph/MutableNetwork.java

  /**
   * Removes {@code edge} from this network, if it is present.
   *
   * @return {@code true} if the network was modified as a result of this call
   */
  @CanIgnoreReturnValue
  boolean removeEdge(E edge);

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Mon Apr 26 17:43:39 UTC 2021

- 4.4K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

  public void removeEdge_existingSelfLoopEdge() {
    assume().that(graphIsMutable()).isTrue();
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(networkAsMutableNetwork.removeEdge(E11)).isTrue();
    assertThat(network.edges()).doesNotContain(E11);
    assertThat(network.edgesConnecting(N1, N1)).isEmpty();
  }

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Tue Jul 02 18:21:29 UTC 2024

- 20.8K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

  public void removeEdge_existingSelfLoopEdge() {
    assume().that(graphIsMutable()).isTrue();
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(networkAsMutableNetwork.removeEdge(E11)).isTrue();
    assertThat(network.edges()).doesNotContain(E11);
    assertThat(network.edgesConnecting(N1, N1)).isEmpty();
  }

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Tue Jul 02 18:21:29 UTC 2024

- 21.2K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java

  public void removeEdge_existingSelfLoopEdge() {
    assume().that(graphIsMutable()).isTrue();
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(networkAsMutableNetwork.removeEdge(E11)).isTrue();
    assertThat(network.edges()).doesNotContain(E11);
    assertThat(network.edgesConnecting(N1, N1)).isEmpty();
  }

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Tue Jul 02 18:21:29 UTC 2024

- 18.6K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java

  public void removeEdge_existingSelfLoopEdge() {
    assume().that(graphIsMutable()).isTrue();
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(networkAsMutableNetwork.removeEdge(E11)).isTrue();
    assertThat(network.edges()).doesNotContain(E11);
    assertThat(network.edgesConnecting(N1, N1)).isEmpty();
  }

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Tue Jul 02 18:21:29 UTC 2024

- 18.9K bytes

- Viewed (0)

Search Options