- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 32 for AddEdge (0.09 sec)
-
maven-model-builder/src/main/java/org/apache/maven/model/building/Graph.java
* under the License. */ package org.apache.maven.model.building; import java.util.*; class Graph { final Map<String, Set<String>> graph = new LinkedHashMap<>(); synchronized void addEdge(String from, String to) throws CycleDetectedException { if (graph.computeIfAbsent(from, l -> new HashSet<>()).add(to)) {
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Mon Jan 22 17:27:48 UTC 2024 - 3.1K bytes - Viewed (0) -
src/go/types/mono.go
return } // flow adds an edge from vertex src representing that typ flows to tpar. flow := func(src int, typ Type) { weight := 1 if typ == targ { weight = 0 } w.addEdge(w.typeParamVertex(tpar), src, weight, pos, targ) } // Recursively walk the type argument to find any defined types or // type parameters. var do func(typ Type) do = func(typ Type) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
import java.util.LinkedList; import java.util.List; import java.util.Map; import java.util.Set; class Graph { final Map<String, Set<String>> graph = new LinkedHashMap<>(); synchronized void addEdge(String from, String to) throws CycleDetectedException { if (graph.computeIfAbsent(from, l -> new HashSet<>()).add(to)) {
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 3.3K bytes - Viewed (0) -
tensorflow/compiler/jit/shape_inference_test.cc
auto sink = ops::Identity(scope.WithOpName("sink"), exit); // Remove the dummy node and add the loop backedge. scope.graph()->RemoveNode(dummy.node()); scope.graph()->AddEdge(next_iteration.node(), 0, merge.output.node(), 1); TF_EXPECT_OK(scope.ToGraph(&graph)); } GraphShapeInfo shape_info; TF_ASSERT_OK(InferShapes(&graph, /*arg_shapes=*/{}, /*fnlib_def=*/nullptr,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 00:41:19 UTC 2024 - 10.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/translate/export_graphdef.cc
<< "Use of BlockArgument encounted before def!"; // For argument, there is only one result output, so the index is always 0. 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.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 01 11:17:36 UTC 2024 - 35.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/api/v2/tf_executor_to_graph.cc
<< "Use of BlockArgument encounted before def!"; // For argument, there is only one result output, so the index is always 0. 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.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jun 06 23:04:51 UTC 2024 - 35.2K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
public Collection<Vertex> getVertices() { return vertices.values(); } Vertex addVertex(String label) { return vertices.computeIfAbsent(label, Vertex::new); } void addEdge(Vertex from, Vertex to) throws CycleDetectedException { from.children.add(to); to.parents.add(from); List<String> cycle = findCycle(to); if (cycle != null) {
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 4.5K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_compile_util.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 09:53:30 UTC 2024 - 4.6K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_util.cc
TF_ASSIGN_OR_RETURN(placeholder_node, g->AddNode(placeholder_def)); placeholders[placeholder_index] = placeholder_node; } else { placeholder_node = iter->second; } g->AddEdge(placeholder_node, 0, dst, dst_input); // Replace `e->dst()` because its input node changed. NodeDef new_def = dst->def(); *new_def.mutable_input(dst_input) = placeholder_node->name();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 15.5K bytes - Viewed (0) -
tensorflow/compiler/jit/build_xla_ops_pass.cc
// TODO(sanjoy): This does not update NodeDef inputs. To be able to update // NodeDef inputs we first need to fix encapsulate_subgraphs_pass to fix up // the NodeDef inputs to the function call nodes. g->AddEdge(new_node, edge->src_output(), edge->dst(), edge->dst_input()); g->RemoveEdge(edge); } } // Returns a data value that is dead iff `control` is dead. Output ControlToData(const Scope& scope, Node* control) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 24.3K bytes - Viewed (0)