- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 476 for nodeV (0.17 sec)
-
tensorflow/c/c_api_function.cc
TF_EXCLUSIVE_LOCKS_REQUIRED(fn_body->mu) { if (num_opers == -1) { for (const Node* node : fn_body->graph.op_nodes()) { const auto& iter = input_nodes.find(node); if (iter == input_nodes.end()) { // This node is not referenced in inputs. Add it to the body. body_nodes->push_back(node); } else { // This node is referenced in inputs. Currently, we place an
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 13.6K bytes - Viewed (2) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
* EndpointPair [N2, N1] - skip * EndpointPair [N2, N3] - return * Visited Nodes = {N1, N2} * EndpointPair [N3, N1] - skip * EndpointPair [N3, N2] - skip * Visited Nodes = {N1, N2, N3} * EndpointPair [N4, N4] - return * Visited Nodes = {N1, N2, N3, N4} * </pre> */ private static final class Undirected<N> extends EndpointPairIterator<N> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
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();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/MetadataGraphNode.java
import java.util.List; /** * MetadataGraph node - as it's a directed graph - holds adjacency lists for incident and exident nodes * * */ @Deprecated public class MetadataGraphNode { /** node payload */ MavenArtifactMetadata metadata; /** nodes, incident to this (depend on me) */ List<MetadataGraphNode> inNodes; /** nodes, exident to this (I depend on) */
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.4K bytes - Viewed (0) -
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);
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.6K bytes - Viewed (0) -
.github/actions/people/app/main.py
repo = g.get_repo(settings.github_repository) discussion_nodes = get_discussion_nodes(settings=settings) experts_results = get_discussions_experts(discussion_nodes=discussion_nodes) pr_nodes = get_pr_nodes(settings=settings) contributors_results = get_contributors(pr_nodes=pr_nodes) authors = {**experts_results.authors, **contributors_results.authors} maintainers_logins = {"tiangolo"}
Python - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Tue Mar 26 17:38:21 GMT 2024 - 19.2K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/TreeTraverser.java
/** Returns the children of the specified node. Must not contain null. */ public abstract Iterable<T> children(T root); /** * Returns an unmodifiable iterable over the nodes in a tree structure, using pre-order traversal. * That is, each node's subtrees are traversed after the node itself is returned. * * <p>No guarantees are made about the behavior of the traversal when nodes change while iteration
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.2K bytes - Viewed (0) -
cmd/peer-s3-client.go
nodes := endpoints.GetNodes() peers = make([]peerS3Client, len(nodes)) for i, node := range nodes { if node.IsLocal { peers[i] = &localPeerS3Client{node: node} } else { peers[i] = newPeerS3Client(node) } peers[i].SetPools(node.Pools) } return peers } // Returns a peer S3 client. func newPeerS3Client(node Node) peerS3Client {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 14.8K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/DefaultDependencyResolverResult.java
*/ private final List<Exception> exceptions; /** * The root node of the dependency graph. */ private final Node root; /** * The ordered list of the flattened dependency nodes. */ private final List<Node> nodes; /** * The file paths of all dependencies, regardless on which Java tool option those paths should be placed. */
Java - Registered: Sun Mar 24 03:35:10 GMT 2024 - Last Modified: Fri Mar 01 17:18:13 GMT 2024 - 14.2K bytes - Viewed (0) -
tensorflow/c/c_api.cc
// Fill graph_def with nodes with ids in the range // [session->last_num_graph_nodes, num_nodes), that is the nodes // added since the last TF_SessionRun() call. for (auto id = session->last_num_graph_nodes; id < num_nodes; ++id) { Node* const node = graph.FindNodeId(id); if (node != nullptr && node->IsOp()) { NodeDef* const node_def = graph_def.add_node();
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 102.3K bytes - Viewed (0)