- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for RemoveEdge (0.12 sec)
-
android/guava/src/com/google/common/graph/StandardMutableGraph.java
return backingValueGraph.removeNode(node); } @Override public boolean removeEdge(N nodeU, N nodeV) { return backingValueGraph.removeEdge(nodeU, nodeV) != null; } @Override public boolean removeEdge(EndpointPair<N> endpoints) { validateEndpoints(endpoints); return removeEdge(endpoints.nodeU(), endpoints.nodeV()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardMutableGraph.java
return backingValueGraph.removeNode(node); } @Override public boolean removeEdge(N nodeU, N nodeV) { return backingValueGraph.removeEdge(nodeU, nodeV) != null; } @Override public boolean removeEdge(EndpointPair<N> endpoints) { validateEndpoints(endpoints); return removeEdge(endpoints.nodeU(), endpoints.nodeV()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.4K 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) -
android/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) -
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) -
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)