- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 40 for RemoveEdge (0.13 sec)
-
android/guava/src/com/google/common/graph/StandardMutableNetwork.java
for (E edge : ImmutableList.copyOf(connections.incidentEdges())) { removeEdge(edge); } nodeConnections.remove(node); return true; } @Override @CanIgnoreReturnValue public boolean removeEdge(E edge) { checkNotNull(edge, "edge"); N nodeU = edgeToReferenceNode.get(edge); if (nodeU == null) { return false;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 5.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/MutableValueGraph.java
* * @return the value previously associated with the edge connecting {@code nodeU} to {@code * nodeV}, or null if there was no such edge. */ @CanIgnoreReturnValue @CheckForNull V removeEdge(N nodeU, N nodeV); /** * Removes the edge connecting {@code endpoints}, if it is present. * * <p>If this graph is directed, {@code endpoints} must be ordered. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/MutableGraph.java
/** * Removes the edge connecting {@code nodeU} to {@code nodeV}, if it is present. * * @return {@code true} if the graph was modified as a result of this call */ @CanIgnoreReturnValue boolean removeEdge(N nodeU, N nodeV); /** * Removes the edge connecting {@code endpoints}, if it is present. * * <p>If this graph is directed, {@code endpoints} must be ordered. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableValueGraph.java
* * @return the value previously associated with the edge connecting {@code nodeU} to {@code * nodeV}, or null if there was no such edge. */ @CanIgnoreReturnValue @CheckForNull V removeEdge(N nodeU, N nodeV); /** * Removes the edge connecting {@code endpoints}, if it is present. * * <p>If this graph is directed, {@code endpoints} must be ordered. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardMutableNetwork.java
for (E edge : ImmutableList.copyOf(connections.incidentEdges())) { removeEdge(edge); } nodeConnections.remove(node); return true; } @Override @CanIgnoreReturnValue public boolean removeEdge(E edge) { checkNotNull(edge, "edge"); N nodeU = edgeToReferenceNode.get(edge); if (nodeU == null) { return false;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 5.7K 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) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { EndpointPair<Integer> edge = edgeList.get(i); assertThat(graph.removeEdge(edge.nodeU(), edge.nodeV())).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES); assertThat(graph.edges()).hasSize(NUM_EDGES - numEdgesToRemove); AbstractGraphTest.validateGraph(graph);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Aug 18 16:17:46 UTC 2017 - 4.2K 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) -
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)