- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 37 for removeEdge (0.27 sec)
-
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
} @Test public void removeEdge_antiparallelEdges() { 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
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
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()); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} @Test public void removeEdge_existingEdge() { assume().that(graphIsMutable()).isTrue(); 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();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K 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. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.9K 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); }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 3.9K 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;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 5.7K 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); }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/EndpointPairTest.java
directedGraph.putEdge(N2, N1); containsExactlySanityCheck(edges, EndpointPair.ordered(N1, N2), EndpointPair.ordered(N2, N1)); directedGraph.removeEdge(N1, N2); directedGraph.removeEdge(N2, N1); containsExactlySanityCheck(edges); assertThrows( UnsupportedOperationException.class, () -> edges.add(EndpointPair.ordered(N1, N2))); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/EndpointPairTest.java
directedGraph.putEdge(N2, N1); containsExactlySanityCheck(edges, EndpointPair.ordered(N1, N2), EndpointPair.ordered(N2, N1)); directedGraph.removeEdge(N1, N2); directedGraph.removeEdge(N2, N1); containsExactlySanityCheck(edges); assertThrows( UnsupportedOperationException.class, () -> edges.add(EndpointPair.ordered(N1, N2))); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K 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);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0)