@Override public Set<E> edgesConnecting(N nodeU, N nodeV) { NetworkConnections<N, E> connectionsU = checkedConnections(nodeU); if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality return ImmutableSet.of(); } checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); return connectionsU.edgesConnecting(nodeV); }
@Override public Set<E> edgesConnecting(N nodeU, N nodeV) { NetworkConnections<N, E> connectionsU = checkedConnections(nodeU); if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality return ImmutableSet.of(); } checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); return connectionsU.edgesConnecting(nodeV); }
@Override public Set<E> edgesConnecting(N nodeU, N nodeV) { NetworkConnections<N, E> connectionsU = checkedConnections(nodeU); if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality return ImmutableSet.of(); } checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); return connectionsU.edgesConnecting(nodeV); }
@Override public Set<E> edgesConnecting(N nodeU, N nodeV) { NetworkConnections<N, E> connectionsU = checkedConnections(nodeU); if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality return ImmutableSet.of(); } checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); return connectionsU.edgesConnecting(nodeV); }
@Override public Set<E> edgesConnecting(N nodeU, N nodeV) { NetworkConnections<N, E> connectionsU = checkedConnections(nodeU); if (!allowsSelfLoops && nodeU == nodeV) { // just an optimization, only check reference equality return ImmutableSet.of(); } checkArgument(containsNode(nodeV), NODE_NOT_IN_GRAPH, nodeV); return connectionsU.edgesConnecting(nodeV); }