N nodeV = endpoints.nodeV();
    return nodes().contains(nodeU) && successors(nodeU).contains(nodeV);
  }

  @Override
  public Network<N, EndpointPair<N>> asNetwork() {
    return new AbstractNetwork<N, EndpointPair<N>>() {
      @Override
      public Set<N> nodes() {
        return AbstractBaseGraph.this.nodes();
      }

      @Override
      public Set<EndpointPair<N>> edges() {

   * the order in which they are iterated over, are irrelevant.
   *
   * <p>A reference implementation of this is provided by {@link AbstractNetwork#equals(Object)}.
   */
  @Override
  boolean equals(@Nullable Object object);

  /**
   * Returns the hash code for this network. The hash code of a network is defined as the hash code