- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 51 for AddEdge (0.14 sec)
-
tensorflow/compiler/jit/shape_inference.cc
graph->RemoveEdge(e); } else { Node* dst = e->dst(); int dst_input = e->dst_input(); graph->RemoveEdge(e); graph->AddEdge(const_node, 0, dst, dst_input); } } } } } // Merge node causes a loop so we remove NextIteration->Merge edge before
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 00:41:19 UTC 2024 - 13K bytes - Viewed (0) -
src/runtime/mklockrank.go
if err != nil { log.Fatal(err) } var out []byte if *flagDot { var b bytes.Buffer g.TransitiveReduction() // Add cyclic edges for visualization. for k := range cyclicRanks { g.AddEdge(k, k) } // Reverse the graph. It's much easier to read this as // a "<" partial order than a ">" partial order. This // ways, locks are acquired from the top going down
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 9.1K bytes - Viewed (0) -
tensorflow/compiler/jit/increase_dynamism_for_auto_jit_pass.cc
DCHECK(e->src_output() == 0 || e->src_output() == Graph::kControlSlot); int src_output = e->src_output(); int dst_input = e->dst_input(); Node* dst = e->dst(); g->RemoveEdge(e); g->AddEdge(static_shaped_slice, src_output, dst, dst_input); } for (const Edge* e : slice->in_edges()) { if (e->IsControlEdge()) { g->AddControlEdge(e->src(), static_shaped_slice); } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 13.8K bytes - Viewed (0) -
tensorflow/compiler/jit/extract_outside_compilation_pass_test.cc
TF_CHECK_OK(NodeDefBuilder("fn", "fn", &fld) .Input("const", 0, DT_INT32) .Finalize(&fn_def)); Node *fn_node = g->AddNode(fn_def, &s); TF_CHECK_OK(s); g->AddEdge(const_node, 0, fn_node, 0); NodeDef ret_def; TF_CHECK_OK(NodeDefBuilder("ret", "_Retval") .Attr("index", 0) .Attr("T", DT_INT32)
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 41K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
MutableNetwork<String, Integer> network = NetworkBuilder.directed().build(); network.addEdge("a", "b", 11); Traverser.forTree(network); // Does not throw } @Test public void forTree_withUndirectedNetwork_throws() throws Exception { MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build(); network.addEdge("a", "b", 11);
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
MutableNetwork<String, Integer> network = NetworkBuilder.directed().build(); network.addEdge("a", "b", 11); Traverser.forTree(network); // Does not throw } @Test public void forTree_withUndirectedNetwork_throws() throws Exception { MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build(); network.addEdge("a", "b", 11);
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/mlir/tensorflow/utils/export_utils.cc
*node_def->mutable_op() = "Stateless" + node_def->op(); } // Add inputs to the NodeDef based on the number of operands. This is required // as later when edges are added to the Node using Graph::AddEdge the // associated NodeDef is not updated. for (int i = 0, e = inst->getNumOperands(); i < e; ++i) { node_def->add_input(); } if (auto attr = inst->getAttrOfType<mlir::StringAttr>("device")) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 17 17:58:54 UTC 2024 - 19.7K bytes - Viewed (0) -
maven-core/src/test/resources/apiv4-repo/org/codehaus/plexus/plexus-utils/1.1/plexus-utils-1.1.jar
java.io.Serializable { private java.util.Map vertexMap; private java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List...
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Sun Oct 02 08:41:25 UTC 2022 - 164.6K bytes - Viewed (0) -
maven-api-impl/src/test/remote-repo/org/codehaus/plexus/plexus-utils/1.1/plexus-utils-1.1.jar
java.io.Serializable { private java.util.Map vertexMap; private java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List...
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu May 02 15:10:38 UTC 2024 - 164.6K bytes - Viewed (0) -
maven-core/src/test/resources/apiv4-repo/org/codehaus/plexus/plexus-utils/1.0.4/plexus-utils-1.0.4.jar
java.io.Serializable { private java.util.Map vertexMap; private java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List...
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Sun Oct 02 08:41:25 UTC 2022 - 160K bytes - Viewed (0)