Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for degree_selfLoop (0.08 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

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

        putEdge(N1, N2);
        assertThat(graph.incidentEdges(N1))
            .containsExactly(EndpointPair.unordered(N1, N1), EndpointPair.unordered(N1, N2));
      }
    
      @Test
      public void degree_selfLoop() {
        assume().that(graph.allowsSelfLoops()).isTrue();
    
        putEdge(N1, N1);
        assertThat(graph.degree(N1)).isEqualTo(2);
        putEdge(N1, N2);
        assertThat(graph.degree(N1)).isEqualTo(3);
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Oct 06 20:14:55 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  2. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

        putEdge(N1, N2);
        assertThat(graph.incidentEdges(N1))
            .containsExactly(EndpointPair.unordered(N1, N1), EndpointPair.unordered(N1, N2));
      }
    
      @Test
      public void degree_selfLoop() {
        assume().that(graph.allowsSelfLoops()).isTrue();
    
        putEdge(N1, N1);
        assertThat(graph.degree(N1)).isEqualTo(2);
        putEdge(N1, N2);
        assertThat(graph.degree(N1)).isEqualTo(3);
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Oct 06 20:14:55 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
        assertThat(network.incidentNodes(E11).target()).isEqualTo(N1);
      }
    
      @Test
      public void degree_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
        assertThat(network.degree(N1)).isEqualTo(2);
        addEdge(N1, N2, E12);
        assertThat(network.degree(N1)).isEqualTo(3);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 21.3K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java

        addEdge(N1, N1, E11);
        assertThat(network.successors(N1)).containsExactly(N1);
        addEdge(N2, N1, E12);
        assertThat(network.successors(N1)).containsExactly(N1, N2);
      }
    
      @Test
      public void degree_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
        assertThat(network.degree(N1)).isEqualTo(2);
        addEdge(N1, N2, E12);
        assertThat(network.degree(N1)).isEqualTo(3);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 19K bytes
    - Click Count (0)
  5. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java

        addEdge(N1, N1, E11);
        assertThat(network.successors(N1)).containsExactly(N1);
        addEdge(N2, N1, E12);
        assertThat(network.successors(N1)).containsExactly(N1, N2);
      }
    
      @Test
      public void degree_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
        assertThat(network.degree(N1)).isEqualTo(2);
        addEdge(N1, N2, E12);
        assertThat(network.degree(N1)).isEqualTo(3);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 18.6K bytes
    - Click Count (0)
Back to Top