@Test public void removeNode_nodeNotPresent() { addNode(N1); ImmutableSet<Integer> nodes = ImmutableSet.copyOf(network.nodes()); assertFalse(network.removeNode(NODE_NOT_IN_GRAPH)); assertThat(network.nodes()).containsExactlyElementsIn(nodes); }
@Test public void removeNode_existingNode() { addEdge(N1, N2, E12); addEdge(N4, N1, E41); assertTrue(network.removeNode(N1)); assertFalse(network.removeNode(N1)); assertThat(network.nodes()).containsExactly(N2, N4); assertThat(network.edges()).doesNotContain(E12); assertThat(network.edges()).doesNotContain(E41); }
@Test public void removeNode_existingNodeWithSelfLoopEdge() { addNode(N1); addEdge(N1, N1, E11); assertThat(network.removeNode(N1)).isTrue(); assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).doesNotContain(E11); }
@Test public void removeNode_existingNodeWithSelfLoopEdge() { addNode(N1); addEdge(N1, N1, E11); assertThat(network.removeNode(N1)).isTrue(); assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).doesNotContain(E11); }
int numNodesToRemove = gen.nextInt(NUM_NODES); for (int i = 0; i < numNodesToRemove; ++i) { assertThat(network.removeNode(nodeList.get(i))).isTrue(); assertThat(network.removeNode(nodeList.get(i))).isTrue();
@Test public void removeNode_queryAfterRemoval() { addNode(N1); @SuppressWarnings("unused") Set<Integer> unused = network.adjacentNodes(N1); // ensure cache (if any) is populated assertTrue(network.removeNode(N1)); try { network.adjacentNodes(N1); fail(ERROR_NODE_NOT_IN_GRAPH); } catch (IllegalArgumentException e) { assertNodeNotInGraphErrorMessage(e); } }
@Override public synchronized boolean removeNode(N arg0) { return delegate.removeNode(arg0); } }
@Override public boolean removeVertex(V v) { return network.removeNode(v); }
@Override public boolean removeNode(N node) { checkNotNull(node, "node"); if (!nodes().contains(node)) { return false; } for (N nodeToRemove : Traverser.forTree(delegate).breadthFirst(node)) { delegate.removeNode(nodeToRemove); depths.remove(nodeToRemove); } if (root.isPresent() && root.get().equals(node)) { setRoot(Optional.empty()); } // Reset the height, since we don't know how it was affected by removing the subtree. this.height = Optional.empty(); return true; }
@Override public boolean removeNode(N node) { // remove all incident edges first, so that the appropriate events will // be fired (otherwise they'll be removed inside {@code // delegate.removeNode} // and the events will not be fired) List<E> incident_edges = ImmutableList.copyOf(delegate.incidentEdges(node)); for (E e : incident_edges) { this.removeEdge(e); } boolean state = delegate.removeNode(node); if (state) { NetworkEvent<N, E> evt = new NetworkEvent.Node<N, E>(delegate, NetworkEvent.Type.NODE_REMOVED, (N) node); fireGraphEvent(evt); } return state; }
public void actionPerformed(ActionEvent e) { pickedNodeState.pick(node, false); graph.removeNode(node); vv.getNodeSpatial().recalculate(); vv.repaint(); } });
graph.removeNode(virtualNode);
@Test public void removeNode_nodeNotPresent() { addNode(N1); ImmutableSet<Integer> nodes = ImmutableSet.copyOf(network.nodes()); assertFalse(network.removeNode(NODE_NOT_IN_GRAPH)); assertThat(network.nodes()).containsExactlyElementsIn(nodes); }
@Test public void removeNode_existingNodeWithSelfLoopEdge() { addNode(N1); addEdge(N1, N1, E11); assertThat(network.removeNode(N1)).isTrue(); assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).doesNotContain(E11); }
@Test public void removeNode_existingNode() { addEdge(N1, N2, E12); addEdge(N4, N1, E41); assertTrue(network.removeNode(N1)); assertFalse(network.removeNode(N1)); assertThat(network.nodes()).containsExactly(N2, N4); assertThat(network.edges()).doesNotContain(E12); assertThat(network.edges()).doesNotContain(E41); }
@Test public void removeNode_existingNodeWithSelfLoopEdge() { addNode(N1); addEdge(N1, N1, E11); assertThat(network.removeNode(N1)).isTrue(); assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).doesNotContain(E11); }
@Test public void removeNode_queryAfterRemoval() { addNode(N1); @SuppressWarnings("unused") Set<Integer> unused = network.adjacentNodes(N1); // ensure cache (if any) is populated assertTrue(network.removeNode(N1)); try { network.adjacentNodes(N1); fail(ERROR_NODE_NOT_IN_GRAPH); } catch (IllegalArgumentException e) { assertNodeNotInGraphErrorMessage(e); } }
int numNodesToRemove = gen.nextInt(NUM_NODES); for (int i = 0; i < numNodesToRemove; ++i) { assertThat(network.removeNode(nodeList.get(i))).isTrue(); assertThat(network.removeNode(nodeList.get(i))).isTrue();