Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for adjacentNodes_selfLoop (0.55 seconds)

  2. github.com/google/guava

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

        assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(N4, NODE_NOT_IN_GRAPH))).isFalse();
  }

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

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

  @Test
    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)
  3. github.com/google/guava

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

        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N4, NODE_NOT_IN_GRAPH))).isFalse();
  }

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

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

  @Test
    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. github.com/google/guava

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

        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N4, NODE_NOT_IN_GRAPH))).isFalse();
  }

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

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

  @Test
    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)
  5. github.com/google/guava

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

        addEdge(N1, N1, E11);
    assertThat(network.incidentNodes(E11).source()).isEqualTo(N1);
    assertThat(network.incidentNodes(E11).target()).isEqualTo(N1);
  }

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

    addEdge(N1, N1, E11);
    addEdge(N1, N2, E12);
    assertThat(network.adjacentNodes(N1)).containsExactly(N1, N2);
  }

  @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)
  6. github.com/google/guava

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

        addEdge(N1, N1, E11);
    assertThat(network.incidentNodes(E11).nodeU()).isEqualTo(N1);
    assertThat(network.incidentNodes(E11).nodeV()).isEqualTo(N1);
  }

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

    addEdge(N1, N1, E11);
    addEdge(N1, N2, E12);
    assertThat(network.adjacentNodes(N1)).containsExactly(N1, N2);
  }

  @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)
  7. github.com/google/guava

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

        addEdge(N1, N1, E11);
    assertThat(network.incidentNodes(E11).nodeU()).isEqualTo(N1);
    assertThat(network.incidentNodes(E11).nodeV()).isEqualTo(N1);
  }

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

    addEdge(N1, N1, E11);
    addEdge(N1, N2, E12);
    assertThat(network.adjacentNodes(N1)).containsExactly(N1, N2);
  }

  @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