/guava/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
checkState( selfLoopCount <= inEdgeMap.get( ) && selfLoopCount <= outEdgeMap.size( ) ) ;
checkState ( selfLoopCount <= inEdgeMap.size ( ) && selfLoopCount <= outEdgeMap.size ( ) ) ;
final Map<E, N> outEdgeMap; private int selfLoopCount; AbstractDirectedNetworkConnections(Map<E, N> inEdgeMap, Map<E, N> outEdgeMap, int selfLoopCount) { this.inEdgeMap = checkNotNull(inEdgeMap); this.outEdgeMap = checkNotNull(outEdgeMap); this.selfLoopCount = checkNonNegative(selfLoopCount); <extra_id_0> } @Override public Set<N> adjacentNodes() { return Sets.union(predecessors(), successors()); } @Override