Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 13 for hasEdgeConnecting (0.1 sec)

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

        putEdge(N1, N2);
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N1, N2))).isTrue();
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N2, N1))).isTrue();
      }
    
      @Test
      public void hasEdgeConnecting_mismatch() {
        putEdge(N1, N2);
        assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(N1, N2))).isFalse();
        assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(N2, N1))).isFalse();
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java

        addNode(N2);
        assertThat(network.hasEdgeConnecting(N1, N2)).isFalse();
      }
    
      @Test
      public void hasEdgesConnecting_nodesNotInGraph() {
        addNode(N1);
        addNode(N2);
        assertThat(network.hasEdgeConnecting(N1, NODE_NOT_IN_GRAPH)).isFalse();
        assertThat(network.hasEdgeConnecting(NODE_NOT_IN_GRAPH, N2)).isFalse();
        assertThat(network.hasEdgeConnecting(NODE_NOT_IN_GRAPH, NODE_NOT_IN_GRAPH)).isFalse();
      }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 32.7K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/graph/ValueGraphTest.java

        graph.putEdgeValue(1, 2, "A");
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(1, 2))).isFalse();
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(2, 1))).isFalse();
      }
    
      @Test
      public void hasEdgeConnecting_undirected_correct() {
        graph = ValueGraphBuilder.undirected().build();
        graph.putEdgeValue(1, 2, "A");
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(1, 2))).isTrue();
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 17.4K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/graph/ValueGraphTest.java

        graph.putEdgeValue(1, 2, "A");
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(1, 2))).isFalse();
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(2, 1))).isFalse();
      }
    
      @Test
      public void hasEdgeConnecting_undirected_correct() {
        graph = ValueGraphBuilder.undirected().build();
        graph.putEdgeValue(1, 2, "A");
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(1, 2))).isTrue();
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 06 18:35:19 UTC 2024
    - 20K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

        putEdge(N1, N2);
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N1, N2))).isTrue();
        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N2, N1))).isTrue();
      }
    
      @Test
      public void hasEdgeConnecting_mismatch() {
        putEdge(N1, N2);
        assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(N1, N2))).isFalse();
        assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(N2, N1))).isFalse();
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  6. guava/src/com/google/common/graph/Network.java

       * endpoints are unordered and the network is directed; it simply returns {@code false}. This is
       * for consistency with {@link Graph#hasEdgeConnecting(EndpointPair)} and {@link
       * ValueGraph#hasEdgeConnecting(EndpointPair)}.
       *
       * @since 27.1
       */
      boolean hasEdgeConnecting(EndpointPair<N> endpoints);
    
      //
      // Network identity
      //
    
      /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 22.4K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/graph/AbstractNetwork.java

        return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV());
      }
    
      @Override
      public boolean hasEdgeConnecting(N nodeU, N nodeV) {
        checkNotNull(nodeU);
        checkNotNull(nodeV);
        return nodes().contains(nodeU) && successors(nodeU).contains(nodeV);
      }
    
      @Override
      public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
        checkNotNull(endpoints);
        if (!isOrderingCompatible(endpoints)) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Mar 13 18:17:09 UTC 2024
    - 10.1K bytes
    - Viewed (0)
  8. guava/src/com/google/common/graph/AbstractNetwork.java

        return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV());
      }
    
      @Override
      public boolean hasEdgeConnecting(N nodeU, N nodeV) {
        checkNotNull(nodeU);
        checkNotNull(nodeV);
        return nodes().contains(nodeU) && successors(nodeU).contains(nodeV);
      }
    
      @Override
      public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
        checkNotNull(endpoints);
        if (!isOrderingCompatible(endpoints)) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Mar 13 18:17:09 UTC 2024
    - 10.4K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/graph/AbstractGraphTest.java

            assertThat(graph.hasEdgeConnecting(node, successor)).isTrue();
            assertThat(graph.incidentEdges(node)).contains(EndpointPair.of(graph, node, successor));
          }
    
          for (EndpointPair<N> endpoints : sanityCheckSet(graph.incidentEdges(node))) {
            if (graph.isDirected()) {
              assertThat(graph.hasEdgeConnecting(endpoints.source(), endpoints.target())).isTrue();
            } else {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 16.6K bytes
    - Viewed (0)
  10. guava/src/com/google/common/graph/ValueGraph.java

       * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}.
       *
       * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}.
       *
       * @since 23.0
       */
      @Override
      boolean hasEdgeConnecting(N nodeU, N nodeV);
    
      /**
       * Returns true if there is an edge that directly connects {@code endpoints} (in the order, if
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 16K bytes
    - Viewed (0)
Back to top