@Test public void removeEdge_existingEdge() { addEdge(N1, N2, E12); assertTrue(network.removeEdge(E12)); assertFalse(network.removeEdge(E12)); assertThat(network.edges()).doesNotContain(E12); assertThat(network.edgesConnecting(N1, N2)).isEmpty(); }
@Test public void removeEdge_existingSelfLoopEdge() { addEdge(N1, N1, E11); assertThat(network.removeEdge(E11)).isTrue(); assertThat(network.edges()).doesNotContain(E11); assertThat(network.edgesConnecting(N1, N1)).isEmpty(); } }
@Test public void removeEdge_existingSelfLoopEdge() { addEdge(N1, N1, E11); assertThat(network.removeEdge(E11)).isTrue(); assertThat(network.edges()).doesNotContain(E11); assertThat(network.edgesConnecting(N1, N1)).isEmpty(); } }
@Test public void removeEdge_edgeNotPresent() { addEdge(N1, N2, E12); ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); assertFalse(network.removeEdge(EDGE_NOT_IN_GRAPH)); assertThat(network.edges()).containsExactlyElementsIn(edges); }
@Test public void removeEdge_parallelSelfLoopEdge() { addEdge(N1, N1, E11); addEdge(N1, N1, E11_A); addEdge(N1, N2, E12); assertTrue(network.removeEdge(E11_A)); assertThat(network.edgesConnecting(N1, N1)).containsExactly(E11); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12); assertTrue(network.removeEdge(E11)); assertThat(network.edgesConnecting(N1, N1)).isEmpty(); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12); } }
@Test public void removeEdge_parallelSelfLoopEdge() { addEdge(N1, N1, E11); addEdge(N1, N1, E11_A); addEdge(N1, N2, E12); assertTrue(network.removeEdge(E11_A)); assertThat(network.edgesConnecting(N1, N1)).containsExactly(E11); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12); assertTrue(network.removeEdge(E11)); assertThat(network.edgesConnecting(N1, N1)).isEmpty(); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12); } }
@Test public void removeEdge_parallelEdge() { addEdge(N1, N2, E12); addEdge(N1, N2, E12_A); assertTrue(network.removeEdge(E12_A)); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12); }
@Test public void removeEdge_parallelEdge() { addEdge(N1, N2, E12); addEdge(N1, N2, E12_A); addEdge(N2, N1, E21); assertTrue(network.removeEdge(E12_A)); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12, E21); }
@Test public void removeEdge_oneOfMany() { addEdge(N1, N2, E12); addEdge(N1, N3, E13); addEdge(N1, N4, E14); assertThat(network.edges()).containsExactly(E12, E13, E14); assertTrue(network.removeEdge(E13)); assertThat(network.edges()).containsExactly(E12, E14); }
@Test public void removeEdge_queryAfterRemoval() { addEdge(N1, N2, E12); @SuppressWarnings("unused") EndpointPair<Integer> unused = network.incidentNodes(E12); // ensure cache (if any) is populated assertTrue(network.removeEdge(E12)); try { network.incidentNodes(E12); fail(ERROR_EDGE_NOT_IN_GRAPH); } catch (IllegalArgumentException e) { assertEdgeNotInGraphErrorMessage(e); } } }
for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i); assertThat(network.removeEdge(edge)).isTrue();
@Override public E removeEdge(V sourceVertex, V targetVertex) { E e = getEdge(sourceVertex, targetVertex); if (e != null) { network.removeEdge(e); } return e; }
@Override public boolean removeEdge(E edge) { checkNotNull(edge, "edge"); delegate.removeEdge(edge); // remove the subtree rooted at this edge's target return removeNode(delegate.incidentNodes(edge).target()); } }
public void actionPerformed(ActionEvent e) { pickedEdgeState.pick(edge, false); graph.removeEdge(edge); vv.getEdgeSpatial().recalculate(); vv.repaint(); } });
@Test public void removeEdge_existingSelfLoopEdge() { addEdge(N1, N1, E11); assertThat(network.removeEdge(E11)).isTrue(); assertThat(network.edges()).doesNotContain(E11); assertThat(network.edgesConnecting(N1, N1)).isEmpty(); } }
@Test public void removeEdge_existingSelfLoopEdge() { addEdge(N1, N1, E11); assertThat(network.removeEdge(E11)).isTrue(); assertThat(network.edges()).doesNotContain(E11); assertThat(network.edgesConnecting(N1, N1)).isEmpty(); } }
@Test public void removeEdge_edgeNotPresent() { addEdge(N1, N2, E12); ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); assertFalse(network.removeEdge(EDGE_NOT_IN_GRAPH)); assertThat(network.edges()).containsExactlyElementsIn(edges); }
@Test public void removeEdge_parallelEdge() { addEdge(N1, N2, E12); addEdge(N1, N2, E12_A); assertTrue(network.removeEdge(E12_A)); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12); }
@Test public void removeEdge_oneOfMany() { addEdge(N1, N2, E12); addEdge(N1, N3, E13); addEdge(N1, N4, E14); assertThat(network.edges()).containsExactly(E12, E13, E14); assertTrue(network.removeEdge(E13)); assertThat(network.edges()).containsExactly(E12, E14); }
@Test public void removeEdge_parallelEdge() { addEdge(N1, N2, E12); addEdge(N1, N2, E12_A); addEdge(N2, N1, E21); assertTrue(network.removeEdge(E12_A)); assertThat(network.edgesConnecting(N1, N2)).containsExactly(E12, E21); }