Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for incidentEdges_selfLoop (0.1 seconds)

  1. 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);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Oct 06 20:14:55 GMT 2025
    - 14.4K bytes
    - Click Count (0)
  2. 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);
    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. 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);
    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)
  4. 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
    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)
  5. 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
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 19K bytes
    - Click Count (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
    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