@Test public void successors_oneEdge() { addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactly(N2); assertThat(network.successors(N2)).containsExactly(N1); }
@Test public void successors_oneEdge() { addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactly(N2); // Edge direction handled correctly assertThat(network.successors(N2)).isEmpty(); }
@Test public void successors_selfLoop() { addEdge(N1, N1, E11); assertThat(network.successors(N1)).containsExactly(N1); addEdge(N2, N1, E12); assertThat(network.successors(N1)).containsExactly(N1, N2); }
@Test public void successors_selfLoop() { addEdge(N1, N1, E11); assertThat(network.successors(N1)).containsExactly(N1); addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactly(N1, N2); }
@Override @Test public void successors_checkReturnedSetMutability() { addNode(N1); Set<Integer> successors = network.successors(N1); try { successors.add(N2); fail(ERROR_MODIFIABLE_COLLECTION); } catch (UnsupportedOperationException e) { addEdge(N1, N2, E12); assertThat(successors).containsExactlyElementsIn(network.successors(N1)); } }
@Override @Test public void successors_checkReturnedSetMutability() { addNode(N1); Set<Integer> successors = network.successors(N1); try { successors.add(N2); fail(ERROR_MODIFIABLE_COLLECTION); } catch (UnsupportedOperationException e) { addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactlyElementsIn(successors); } }
@Test public void successors_noSuccessors() { addNode(N1); assertThat(network.successors(N1)).isEmpty(); }
@Test public void successors_nodeNotInGraph() { try { network.successors(NODE_NOT_IN_GRAPH); fail(ERROR_NODE_NOT_IN_GRAPH); } catch (IllegalArgumentException e) { assertNodeNotInGraphErrorMessage(e); } }
@After public void validateUndirectedEdges() { for (Integer node : network.nodes()) { new EqualsTester() .addEqualityGroup( network.inEdges(node), network.outEdges(node), network.incidentEdges(node)) .testEquals(); new EqualsTester() .addEqualityGroup( network.predecessors(node), network.successors(node), network.adjacentNodes(node)) .testEquals(); for (Integer adjacentNode : network.adjacentNodes(node)) { assertThat(network.edgesConnecting(node, adjacentNode)) .containsExactlyElementsIn(network.edgesConnecting(adjacentNode, node)); } } }
@Override public Set<N> successors(N node) { return delegate.successors(node); } }
@Override public synchronized Set<N> successors(N arg0) { return delegate.successors(arg0); }
@Override public Set<N> successors(N node) { checkNotNull(node, "node"); checkArgument(delegate.nodes().contains(node), NODE_NOT_IN_TREE, node); return delegate.successors(node); }
@Test public void successors_oneEdge() { addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactly(N2); // Edge direction handled correctly assertThat(network.successors(N2)).isEmpty(); }
@Test public void successors_oneEdge() { addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactly(N2); assertThat(network.successors(N2)).containsExactly(N1); }
@Test public void successors_selfLoop() { addEdge(N1, N1, E11); assertThat(network.successors(N1)).containsExactly(N1); addEdge(N2, N1, E12); assertThat(network.successors(N1)).containsExactly(N1, N2); }
@Test public void successors_selfLoop() { addEdge(N1, N1, E11); assertThat(network.successors(N1)).containsExactly(N1); addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactly(N1, N2); }
@Override @Test public void successors_checkReturnedSetMutability() { addNode(N1); Set<Integer> successors = network.successors(N1); try { successors.add(N2); fail(ERROR_MODIFIABLE_COLLECTION); } catch (UnsupportedOperationException e) { addEdge(N1, N2, E12); assertThat(successors).containsExactlyElementsIn(network.successors(N1)); } }
@Override @Test public void successors_checkReturnedSetMutability() { addNode(N1); Set<Integer> successors = network.successors(N1); try { successors.add(N2); fail(ERROR_MODIFIABLE_COLLECTION); } catch (UnsupportedOperationException e) { addEdge(N1, N2, E12); assertThat(network.successors(N1)).containsExactlyElementsIn(successors); } }
@Test public void successors_noSuccessors() { addNode(N1); assertThat(network.successors(N1)).isEmpty(); }
@Test public void successors_nodeNotInGraph() { try { network.successors(NODE_NOT_IN_GRAPH); fail(ERROR_NODE_NOT_IN_GRAPH); } catch (IllegalArgumentException e) { assertNodeNotInGraphErrorMessage(e); } }