Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 18 for outDegree (0.15 sec)

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

        assertThat(graph.inDegree(N1)).isEqualTo(1);
      }
    
      @Test
      public void outDegree_oneEdge() {
        putEdge(N1, N2);
        assertThat(graph.outDegree(N1)).isEqualTo(1);
        assertThat(graph.outDegree(N2)).isEqualTo(1);
      }
    
      @Test
      public void hasEdgeConnecting_correct() {
        putEdge(N1, N2);
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N1, N2))).isTrue();
    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/src/com/google/common/graph/ForwardingValueGraph.java

        return delegate().degree(node);
      }
    
      @Override
      public int inDegree(N node) {
        return delegate().inDegree(node);
      }
    
      @Override
      public int outDegree(N node) {
        return delegate().outDegree(node);
      }
    
      @Override
      public boolean hasEdgeConnecting(N nodeU, N nodeV) {
        return delegate().hasEdgeConnecting(nodeU, nodeV);
      }
    
      @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.8K bytes
    - Viewed (0)
  3. guava/src/com/google/common/graph/ForwardingValueGraph.java

        return delegate().degree(node);
      }
    
      @Override
      public int inDegree(N node) {
        return delegate().inDegree(node);
      }
    
      @Override
      public int outDegree(N node) {
        return delegate().outDegree(node);
      }
    
      @Override
      public boolean hasEdgeConnecting(N nodeU, N nodeV) {
        return delegate().hasEdgeConnecting(nodeU, nodeV);
      }
    
      @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 3.1K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/ForwardingGraph.java

        return delegate().degree(node);
      }
    
      @Override
      public int inDegree(N node) {
        return delegate().inDegree(node);
      }
    
      @Override
      public int outDegree(N node) {
        return delegate().outDegree(node);
      }
    
      @Override
      public boolean hasEdgeConnecting(N nodeU, N nodeV) {
        return delegate().hasEdgeConnecting(nodeU, nodeV);
      }
    
      @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 2.5K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java

        assertThat(graph.inDegree(N1)).isEqualTo(0);
      }
    
      @Test
      public void outDegree_oneEdge() {
        putEdge(N1, N2);
        assertThat(graph.outDegree(N1)).isEqualTo(1);
        // Edge direction handled correctly
        assertThat(graph.outDegree(N2)).isEqualTo(0);
      }
    
      @Test
      public void hasEdgeConnecting_correct() {
        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)
  6. android/guava/src/com/google/common/graph/ForwardingNetwork.java

        return delegate().degree(node);
      }
    
      @Override
      public int inDegree(N node) {
        return delegate().inDegree(node);
      }
    
      @Override
      public int outDegree(N node) {
        return delegate().outDegree(node);
      }
    
      @Override
      public Set<E> edgesConnecting(N nodeU, N nodeV) {
        return delegate().edgesConnecting(nodeU, nodeV);
      }
    
      @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

        assertThat(network.inDegree(N1)).isEqualTo(0);
      }
    
      @Test
      public void outDegree_oneEdge() {
        addEdge(N1, N2, E12);
        assertThat(network.outDegree(N1)).isEqualTo(1);
        // Edge direction handled correctly
        assertThat(network.outDegree(N2)).isEqualTo(0);
      }
    
      @Test
      public void edges_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 20.9K bytes
    - Viewed (0)
  8. guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java

        assertThat(network.inDegree(N1)).isEqualTo(0);
      }
    
      @Test
      public void outDegree_oneEdge() {
        addEdge(N1, N2, E12);
        assertThat(network.outDegree(N1)).isEqualTo(1);
        // Edge direction handled correctly
        assertThat(network.outDegree(N2)).isEqualTo(0);
      }
    
      @Test
      public void edges_selfLoop() {
        assume().that(network.allowsSelfLoops()).isTrue();
    
        addEdge(N1, N1, E11);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 21.3K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/graph/GraphsTest.java

        AbstractGraphTest.validateGraph(transpose);
    
        for (Integer node : directedGraph.nodes()) {
          assertThat(directedGraph.inDegree(node)).isSameInstanceAs(transpose.outDegree(node));
          assertThat(directedGraph.outDegree(node)).isSameInstanceAs(transpose.inDegree(node));
        }
    
        assertThat(transpose.successors(N1)).doesNotContain(N2);
        directedGraph.putEdge(N2, N1);
        // View should be updated.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 24.6K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

        assertThat(graph.inDegree(N1)).isEqualTo(1);
      }
    
      @Test
      public void outDegree_oneEdge() {
        putEdge(N1, N2);
        assertThat(graph.outDegree(N1)).isEqualTo(1);
        assertThat(graph.outDegree(N2)).isEqualTo(1);
      }
    
      @Test
      public void hasEdgeConnecting_correct() {
        putEdge(N1, N2);
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N1, N2))).isTrue();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 12.7K bytes
    - Viewed (0)
Back to top