@Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); }
@Override public Set<N> adjacentNodes(N node) { return network.adjacentNodes(node); }
@Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); }
@Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); }
assertThat(network.edgesConnecting(nodeU, nodeV)).contains(edge); assertThat(network.successors(nodeU)).contains(nodeV); assertThat(network.adjacentNodes(nodeU)).contains(nodeV); assertThat(network.outEdges(nodeU)).contains(edge); assertThat(network.incidentEdges(nodeU)).contains(edge); assertThat(network.predecessors(nodeV)).contains(nodeU); assertThat(network.adjacentNodes(nodeV)).contains(nodeU); assertThat(network.inEdges(nodeV)).contains(edge); assertThat(network.incidentEdges(nodeV)).contains(edge); assertThat(nodeString).contains(node.toString()); assertThat(network.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node)); assertThat(network.predecessors(node)).isEqualTo(asGraph.predecessors(node)); assertThat(network.successors(node)).isEqualTo(asGraph.successors(node)); assertThat(network.outEdges(node)).hasSize(network.outDegree(node)); } else { assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node)); assertThat(network.successors(node)).isEqualTo(network.adjacentNodes(node)); assertThat(network.inEdges(node)).isEqualTo(network.incidentEdges(node)); assertThat(network.outEdges(node)).isEqualTo(network.incidentEdges(node)); for (N adjacentNode : sanityCheckSet(network.adjacentNodes(node))) { assertTrue( network.predecessors(node).contains(adjacentNode)
@Override public Set<N> adjacentNodes(N node) { return network.adjacentNodes(node); }
@Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); }
@Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); }
Collection<N> neighbors = graph.adjacentNodes(currentNode);
public Stroke apply(N v) { if (highlight) { if (pi.isPicked(v)) { return heavy; } else { for (N w : graph.adjacentNodes(v)) { if (pi.isPicked(w)) { return medium; } } return light; } } else { return light; } } }
tree.addEdge(graph.incidentNodes(edge).adjacentNode(node), node, edge); for (N adjacentNode : graph.adjacentNodes(node)) { if (!remainingNodes.contains(adjacentNode)) { continue;
node.toString() + ". with neighbors:" + vv.getModel().getNetwork().adjacentNodes(node));
assertThat(network.edgesConnecting(nodeU, nodeV)).contains(edge); assertThat(network.successors(nodeU)).contains(nodeV); assertThat(network.adjacentNodes(nodeU)).contains(nodeV); assertThat(network.outEdges(nodeU)).contains(edge); assertThat(network.incidentEdges(nodeU)).contains(edge); assertThat(network.predecessors(nodeV)).contains(nodeU); assertThat(network.adjacentNodes(nodeV)).contains(nodeU); assertThat(network.inEdges(nodeV)).contains(edge); assertThat(network.incidentEdges(nodeV)).contains(edge); assertThat(nodeString).contains(node.toString()); assertThat(network.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node)); assertThat(network.predecessors(node)).isEqualTo(asGraph.predecessors(node)); assertThat(network.successors(node)).isEqualTo(asGraph.successors(node)); assertThat(network.outEdges(node)).hasSize(network.outDegree(node)); } else { assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node)); assertThat(network.successors(node)).isEqualTo(network.adjacentNodes(node)); assertThat(network.inEdges(node)).isEqualTo(network.incidentEdges(node)); assertThat(network.outEdges(node)).isEqualTo(network.incidentEdges(node)); for (N adjacentNode : sanityCheckSet(network.adjacentNodes(node))) { assertTrue( network.predecessors(node).contains(adjacentNode)