allowsSelfLoops - Code Search

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

    assume().that(graph.allowsSelfLoops()).isFalse();

    IllegalArgumentException e =
        assertThrows(IllegalArgumentException.class, () -> putEdge(N1, N1));
    assertThat(e).hasMessageThat().contains(ERROR_SELF_LOOP);
  }

  @Test
  public void putEdge_allowsSelfLoops() {
    assume().that(graphIsMutable()).isTrue();
    assume().that(graph.allowsSelfLoops()).isTrue();

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)

github.com/google/guava

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

  }

  @Test
  public void adjacentNodes_selfLoop() {
    assume().that(graph.allowsSelfLoops()).isTrue();

    putEdge(N1, N1);
    putEdge(N1, N2);
    assertThat(graph.adjacentNodes(N1)).containsExactly(N1, N2);
  }

  @Test
  public void predecessors_selfLoop() {
    assume().that(graph.allowsSelfLoops()).isTrue();

    putEdge(N1, N1);
    assertThat(graph.predecessors(N1)).containsExactly(N1);

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)

github.com/google/guava

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

  private static final AbstractGraphBuilder<?> GRAPH_BUILDER_A =
      GraphBuilder.directed().expectedNodeCount(10);
  private static final AbstractGraphBuilder<?> GRAPH_BUILDER_B =
      ValueGraphBuilder.directed().allowsSelfLoops(true).expectedNodeCount(16);

  private static final ImmutableGraph<String> IMMUTABLE_GRAPH_A =
      GraphBuilder.directed().<String>immutable().addNode("A").build();

Java

- Registered: Fri May 03 12:43:13 GMT 2024

- Last Modified: Thu Nov 09 19:24:25 GMT 2023

- 3.2K bytes

- Viewed (0)

github.com/google/guava

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

    MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build();
    directedGraph.putEdge(N1, N2);
    directedGraph.putEdge(N1, N3);
    directedGraph.putEdge(N2, N3);
    directedGraph.addNode(N4);

    MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build();
    expectedClosure.putEdge(N1, N1);
    expectedClosure.putEdge(N1, N2);

Java

- Registered: Fri May 03 12:43:13 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 24.8K bytes

- Viewed (0)

github.com/google/guava

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

  }

  @Test
  public void edges_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.edges()).containsExactly(E11);
  }

  @Test
  public void incidentEdges_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentEdges(N1)).containsExactly(E11);

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)

github.com/google/guava

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

  }

  @Test
  public void adjacentNodes_selfLoop() {
    assume().that(graph.allowsSelfLoops()).isTrue();

    putEdge(N1, N1);
    putEdge(N1, N2);
    assertThat(graph.adjacentNodes(N1)).containsExactly(N1, N2);
  }

  @Test
  public void predecessors_selfLoop() {
    assume().that(graph.allowsSelfLoops()).isTrue();

    putEdge(N1, N1);
    assertThat(graph.predecessors(N1)).containsExactly(N1);

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)

github.com/google/guava

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

  }

  @Test
  public void edges_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.edges()).containsExactly(E11);
  }

  @Test
  public void incidentEdges_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentEdges(N1)).containsExactly(E11);

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)

github.com/google/guava

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

    MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build();
    directedGraph.putEdge(N1, N2);
    directedGraph.putEdge(N1, N3);
    directedGraph.putEdge(N2, N3);
    directedGraph.addNode(N4);

    MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build();
    expectedClosure.putEdge(N1, N1);
    expectedClosure.putEdge(N1, N2);

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 24.9K bytes

- Viewed (0)

github.com/google/guava

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

    assume().that(graph.allowsSelfLoops()).isFalse();

    IllegalArgumentException e =
        assertThrows(IllegalArgumentException.class, () -> putEdge(N1, N1));
    assertThat(e).hasMessageThat().contains(ERROR_SELF_LOOP);
  }

  @Test
  public void putEdge_allowsSelfLoops() {
    assume().that(graphIsMutable()).isTrue();
    assume().that(graph.allowsSelfLoops()).isTrue();

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)

github.com/google/guava

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

  }

  @Test
  public void edges_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.edges()).containsExactly(E11);
  }

  @Test
  public void incidentEdges_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentEdges(N1)).containsExactly(E11);

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Wed Sep 06 17:04:31 GMT 2023

- 21.6K bytes

- Viewed (0)

Search Options