- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for RemoveEdge (0.45 sec)
-
tensorflow/compiler/jit/encapsulate_util.cc
// Case 1b: XLA computation to outside compilation in it control edge. ReplaceAttr(e->dst(), kXlaConnectedFromXlaComputationAttrName, true); } } for (auto e : edges_to_remove) { g->RemoveEdge(e); } return absl::OkStatus(); } // Step 2 for `PreprocessEdgesBetweenOutsideCompilations`. See comments of // `PreprocessEdgesBetweenOutsideCompilations` for details.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 15.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
putEdge(N1, N2); assertThat(graph.successors(N1)).containsExactly(N2); assertThat(graph.predecessors(N2)).containsExactly(N1); assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue(); assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isFalse(); assertThat(graph.successors(N1)).isEmpty(); assertThat(graph.predecessors(N2)).isEmpty(); } @Test public void removeEdge_oneOfMany() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assume().that(graphIsMutable()).isTrue(); putEdge(N1, N2); putEdge(N2, N1); // no-op assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue(); assertThat(graph.adjacentNodes(N1)).isEmpty(); assertThat(graph.edges()).isEmpty(); assertThat(graphAsMutableGraph.removeEdge(N2, N1)).isFalse(); } @Test public void removeNode_existingNodeWithSelfLoopEdge() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 12.9K bytes - Viewed (0) -
tensorflow/compiler/jit/shape_inference.cc
if (e->IsControlEdge()) { graph->AddControlEdge(const_node, e->dst()); 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); } } } } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 00:41:19 UTC 2024 - 13K bytes - Viewed (0) -
tensorflow/compiler/jit/build_xla_ops_pass.cc
// 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) { // The choice of data type here is important. //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 24.3K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/ProjectSorter.java
fromProject.addProjectReference(toProject); } if (force && toVertex.getChildren().contains(fromVertex)) { graph.removeEdge(toVertex, fromVertex); } try { graph.addEdge(fromVertex, toVertex); } catch (CycleDetectedException e) { if (!safe) { throw e;
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 10.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sccp.go
// and thus can be removed in further deadcode phase func rewireSuccessor(block *Block, constVal *Value) bool { switch block.Kind { case BlockIf: block.removeEdge(int(constVal.AuxInt)) block.Kind = BlockPlain block.Likely = BranchUnknown block.ResetControls() return true case BlockJumpTable: // Remove everything but the known taken branch.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:54:50 UTC 2024 - 17.6K bytes - Viewed (0) -
tensorflow/compiler/jit/partially_decluster_pass.cc
} for (const Edge* out_edge_to_clone : out_edges_to_clone) { graph->AddEdge(cloned_node, out_edge_to_clone->src_output(), out_edge_to_clone->dst(), out_edge_to_clone->dst_input()); graph->RemoveEdge(out_edge_to_clone); } if (n->out_edges().empty()) { graph->RemoveNode(n); } return absl::OkStatus(); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 15.7K 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) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void removeEdge_existingSelfLoopEdge() { assume().that(graphIsMutable()).isTrue(); assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(networkAsMutableNetwork.removeEdge(E11)).isTrue(); assertThat(network.edges()).doesNotContain(E11); assertThat(network.edgesConnecting(N1, N1)).isEmpty(); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 18.9K bytes - Viewed (0)