- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 265 for Edges (0.04 sec)
-
tensorflow/compiler/mlir/tf2xla/api/v2/tf_executor_to_graph.cc
graph_->AddEdge(input_node_it->second, 0, dst_node, dst_index); return absl::OkStatus(); } Status Exporter::AddEdge(Operation* inst) { // For tf_executor.fetch, add only its data edges. Control edges are captured // later. if (auto fetch = llvm::dyn_cast<mlir::tf_executor::FetchOp>(inst)) { for (auto operand_and_idx : llvm::enumerate(fetch.getOperands())) { Value operand = operand_and_idx.value();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jun 06 23:04:51 UTC 2024 - 35.2K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/artifact/ResolvedArtifactsGraphVisitor.java
} } if (node.isRoot() || hasTransitiveIncomingEdge) { // Since file dependencies are not modeled as actual edges, we need to verify // there are edges to this node that would follow this file dependency. for (LocalFileDependencyMetadata fileDependency : node.getOutgoingFileEdges()) { int id = nextId++;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 02:21:08 UTC 2024 - 6.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
EndpointPair.unordered(1, 1), EndpointPair.unordered(1, 3)) .inOrder(); } /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateTShapedGraph() { putEdge(2, 1); putEdge(1, 4);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 12.9K bytes - Viewed (0) -
pkg/controller/garbagecollector/dump_test.go
file string nodes []*dotVertex edges []dotEdge }{ { file: "empty.dot", }, { file: "simple.dot", nodes: []*dotVertex{ NewDOTVertex(alphaNode()), NewDOTVertex(bravoNode()), NewDOTVertex(charlieNode()), NewDOTVertex(deltaNode()), NewDOTVertex(foxtrotNode()), NewDOTVertex(golfNode()), }, edges: []dotEdge{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Apr 14 00:05:53 UTC 2023 - 11.2K bytes - Viewed (0) -
src/internal/profile/graph.go
*em = (*em)[:len(*em)-1] return } } } // Edge contains any attributes to be represented about edges in a graph. type Edge struct { Src, Dest *Node // The summary weight of the edge Weight, WeightDiv int64 // residual edges connect nodes that were connected through a // separate node, which has been removed from the report. Residual bool
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 05 20:59:15 UTC 2024 - 13.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
} private static SuccessorsFunction<Character> createDirectedGraph(String... edges) { return createGraph(/* directed= */ true, edges); } private static SuccessorsFunction<Character> createUndirectedGraph(String... edges) { return createGraph(/* directed= */ false, edges); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 47.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
} private static SuccessorsFunction<Character> createDirectedGraph(String... edges) { return createGraph(/* directed= */ true, edges); } private static SuccessorsFunction<Character> createUndirectedGraph(String... edges) { return createGraph(/* directed= */ false, edges); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 47.5K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_xla_computations_pass.cc
// Check for undeclared outputs before Encapsulation, so we can give a better // error message. // TODO(phawkins): merge this with the encapsulation code to avoid the extra // O(n) pass over the edges. for (const Edge* e : (*graph)->edges()) { if (!e->IsControlEdge() && e->src()->attrs().Find(kXlaClusterIdAttr) != nullptr && e->dst()->attrs().Find(kXlaClusterIdAttr) == nullptr &&
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 15.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
// ImmutableMap.Builder maintains the order of the elements as inserted, so the map will have // whatever ordering the network's edges do, so ImmutableSortedMap is unnecessary even if the // input edges are sorted. ImmutableMap.Builder<E, N> edgeToReferenceNode = ImmutableMap.builder(); for (E edge : network.edges()) { edgeToReferenceNode.put(edge, network.incidentNodes(edge).nodeU()); } return edgeToReferenceNode.buildOrThrow();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 9.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/ImmutableNetwork.java
// ImmutableMap.Builder maintains the order of the elements as inserted, so the map will have // whatever ordering the network's edges do, so ImmutableSortedMap is unnecessary even if the // input edges are sorted. ImmutableMap.Builder<E, N> edgeToReferenceNode = ImmutableMap.builder(); for (E edge : network.edges()) { edgeToReferenceNode.put(edge, network.incidentNodes(edge).nodeU()); } return edgeToReferenceNode.buildOrThrow();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 9.6K bytes - Viewed (0)