Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for incidentEdges_selfLoop (0.07 sec)

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

        putEdge(N1, N1);
        assertThat(graph.successors(N1)).containsExactly(N1);
        putEdge(N2, N1);
        assertThat(graph.successors(N1)).containsExactly(N1, N2);
      }
    
      @Test
      public void incidentEdges_selfLoop() {
        assume().that(graph.allowsSelfLoops()).isTrue();
    
        putEdge(N1, N1);
        assertThat(graph.incidentEdges(N1)).containsExactly(EndpointPair.unordered(N1, N1));
        putEdge(N1, N2);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java

        putEdge(N1, N1);
        assertThat(graph.successors(N1)).containsExactly(N1);
        putEdge(N1, N2);
        assertThat(graph.successors(N1)).containsExactly(N1, N2);
      }
    
      @Test
      public void incidentEdges_selfLoop() {
        assume().that(graph.allowsSelfLoops()).isTrue();
    
        putEdge(N1, N1);
        assertThat(graph.incidentEdges(N1)).containsExactly(EndpointPair.ordered(N1, N1));
        putEdge(N1, N2);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 13.9K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

        putEdge(N1, N1);
        assertThat(graph.successors(N1)).containsExactly(N1);
        putEdge(N2, N1);
        assertThat(graph.successors(N1)).containsExactly(N1, N2);
      }
    
      @Test
      public void incidentEdges_selfLoop() {
        assume().that(graph.allowsSelfLoops()).isTrue();
    
        putEdge(N1, N1);
        assertThat(graph.incidentEdges(N1)).containsExactly(EndpointPair.unordered(N1, N1));
        putEdge(N1, N2);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

      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);
      }
    
      @Test
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 20.9K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

      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);
      }
    
      @Test
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 21.3K bytes
    - Viewed (0)
  6. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java

      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);
      }
    
      @Test
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 18.6K bytes
    - Viewed (0)
Back to top