- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for RemoveEdge (0.31 sec)
-
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) -
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) -
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) -
src/cmd/compile/internal/ssa/fuse.go
return false } } // We do not need to redirect the Preds of s0 and s1 to ss, // the following optimization will do this. b.removeEdge(0) if s0 != b && len(s0.Preds) == 0 { s0.removeEdge(0) // Move any (dead) values in s0 to b, // where they will be eliminated by the next deadcode pass. for _, v := range s0.Values { v.Block = b }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 9K bytes - Viewed (0) -
tensorflow/compiler/jit/clone_constants_for_better_clustering.cc
TF_RET_CHECK(e->src_output() == 0) << "expected constant to have exactly one non-control output, but " "found output index = " << e->src_output(); graph_->RemoveEdge(e); graph_->AddEdge(input_cloned, 0, n, dst_input); } } } return absl::OkStatus(); } Status CloneConstantsForBetterClusteringPassImpl::Run() {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 7.3K bytes - Viewed (0)