Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 433 for nodeID (0.08 sec)

  2. github.com/tensorflow/tensorflow

    tensorflow/c/c_api_function_test.cc 

      TF_Operation *node1, *node2, *node3;
  NodeWithPlaceholderAttrHelper(func_graph.get(), s.get(), "node1", "v1",
                                &node1);
  NodeWithPlaceholderAttrHelper(func_graph.get(), s.get(), "node2", "v1",
                                &node2);
  NodeWithPlaceholderAttrHelper(func_graph.get(), s.get(), "node3", "v2",
                                &node3);
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Thu Jul 20 22:08:54 UTC 2023
    - 63.6K bytes
    - Viewed (0)
  3. github.com/google/guava

    guava/src/com/google/common/graph/AbstractNetwork.java 

      }

  @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)) {
      return false;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Mar 13 18:17:09 UTC 2024
    - 10.4K bytes
    - Viewed (0)
  4. github.com/google/guava

    android/guava/src/com/google/common/graph/AbstractNetwork.java 

        validateEndpoints(endpoints);
    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) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Mar 13 18:17:09 UTC 2024
    - 10.1K bytes
    - Viewed (0)
  5. github.com/google/guava

    guava/src/com/google/common/graph/AbstractBaseGraph.java 

        checkNotNull(nodeU);
    checkNotNull(nodeV);
    return nodes().contains(nodeU) && successors(nodeU).contains(nodeV);
  }

  @Override
  public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
    checkNotNull(endpoints);
    if (!isOrderingCompatible(endpoints)) {
      return false;
    }
    N nodeU = endpoints.nodeU();
    N nodeV = endpoints.nodeV();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 7.2K bytes
    - Viewed (0)
  6. github.com/minio/minio

    docs/metrics/prometheus/grafana/node/grafana-node.png 

    grafana-node.png...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jun 04 13:24:37 UTC 2024
    - 133.5K bytes
    - Viewed (0)
  7. github.com/google/guava

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

          checkArgument(
          edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge);
      char node1 = edge.charAt(0);
      char node2 = edge.charAt(1);
      graphMapBuilder.put(node1, node2);
      if (!directed) {
        graphMapBuilder.put(node2, node1);
      }
    }
    final ImmutableMultimap<Character, Character> graphMap = graphMapBuilder.build();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 47.5K bytes
    - Viewed (0)
  8. github.com/google/guava

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

          checkArgument(
          edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge);
      char node1 = edge.charAt(0);
      char node2 = edge.charAt(1);
      graphMapBuilder.put(node1, node2);
      if (!directed) {
        graphMapBuilder.put(node2, node1);
      }
    }
    final ImmutableMultimap<Character, Character> graphMap = graphMapBuilder.build();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 47.5K bytes
    - Viewed (0)
  9. github.com/google/guava

    android/guava/src/com/google/common/graph/Network.java 

       * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}, and to
   * {@code edgeConnectingOrNull(nodeU, nodeV) != null}.
   *
   * <p>In an undirected network, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}.
   *
   * @since 23.0
   */
  boolean hasEdgeConnecting(N nodeU, N nodeV);

  /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 21.1K bytes
    - Viewed (0)
  10. github.com/apache/maven

    compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/ConflictResolver.java 

         *
     * @param node1 the first artifact declaration
     * @param node2 the second artifact declaration
     * @return the artifact declaration to use: <code>node1</code>; <code>node2</code>; or <code>null</code>if
     *         this conflict cannot be resolved
     * @since 3.0
     */
    ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2);
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 1.6K bytes
    - Viewed (0)
  11. github.com/google/guava

    guava/src/com/google/common/graph/AbstractValueGraph.java 

            return AbstractValueGraph.this.degree(node);
      }

      @Override
      public int inDegree(N node) {
        return AbstractValueGraph.this.inDegree(node);
      }

      @Override
      public int outDegree(N node) {
        return AbstractValueGraph.this.outDegree(node);
      }
    };
  }

  @Override
  public Optional<V> edgeValue(N nodeU, N nodeV) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Apr 17 13:59:28 UTC 2023
    - 4.3K bytes
    - Viewed (0)
Back to top