- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 21 for RemoveEdge (0.24 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) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
checkNonNegative(--edgeCount); } return previousValue; } @Override @CanIgnoreReturnValue @CheckForNull public V removeEdge(EndpointPair<N> endpoints) { validateEndpoints(endpoints); return removeEdge(endpoints.nodeU(), endpoints.nodeV()); } private GraphConnections<N, V> newConnections() { return isDirected()
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Oct 21 01:50:30 UTC 2023 - 6.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardMutableValueGraph.java
checkNonNegative(--edgeCount); } return previousValue; } @Override @CanIgnoreReturnValue @CheckForNull public V removeEdge(EndpointPair<N> endpoints) { validateEndpoints(endpoints); return removeEdge(endpoints.nodeU(), endpoints.nodeV()); } private GraphConnections<N, V> newConnections() { return isDirected()
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Oct 21 01:50:30 UTC 2023 - 6.4K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
if (cycle != null) { // remove edge which introduced cycle removeEdge(from, to); throw new CycleDetectedException( "Edge between '" + from.label + "' and '" + to.label + "' introduces to cycle in the graph", cycle); } } void removeEdge(Vertex from, Vertex to) { from.children.remove(to); to.parents.remove(from); }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 4.5K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/Graph.java
if (cycle != null) { // remove edge which introduced cycle removeEdge(from, to); throw new CycleDetectedException( "Edge between '" + from.label + "' and '" + to.label + "' introduces to cycle in the graph", cycle); } } void removeEdge(Vertex from, Vertex to) { from.children.remove(to); to.parents.remove(from); }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 3.9K 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) -
src/cmd/compile/internal/ssa/deadcode.go
for i := 0; i < len(b.Succs); { e := b.Succs[i] if reachable[e.b.ID] { b.removeEdge(i) } else { i++ } } } // Get rid of dead edges from live code. for _, b := range f.Blocks { if !reachable[b.ID] { continue } if b.Kind != BlockFirst { continue } b.removeEdge(1) b.Kind = BlockPlain b.Likely = BranchUnknown }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K 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_helpers.cc
back_edges_.push_back( BackEdge{e, e->src(), e->src_output(), e->dst(), e->dst_input()}); } } } } for (const BackEdge& be : back_edges_) { graph_->RemoveEdge(be.edge); } return absl::OkStatus(); } const std::vector<BackEdgeHelper::BackEdge>& BackEdgeHelper::RemovedEdges() const { return back_edges_; } Status BackEdgeHelper::Replace() {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 1.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)