}

      @Override
      public ElementOrder<N> nodeOrder() {
        return AbstractBaseGraph.this.nodeOrder();
      }

      @Override
      public ElementOrder<EndpointPair<N>> edgeOrder() {
        return ElementOrder.unordered(); // Graph doesn't define edge order
      }

      @Override
      public Set<N> adjacentNodes(N node) {
        return AbstractBaseGraph.this.adjacentNodes(node);

public interface Network<N, E> extends ArchetypeGraph<N> {
  //
  // Network-level accessors
  //

  /** Returns all edges in this network, in the order specified by {@link #edgeOrder()}. */
  Set<E> edges();

  /**
   * Returns a live view of this network as a {@link Graph}. The resulting {@link Graph} will have

    assertThat(graph.isDirected()).isEqualTo(asNetwork.isDirected());
    assertThat(graph.allowsSelfLoops()).isEqualTo(asNetwork.allowsSelfLoops());
    assertThat(asNetwork.edgeOrder()).isEqualTo(ElementOrder.unordered());
    assertThat(asNetwork.allowsParallelEdges()).isFalse();
    assertThat(asNetwork.asGraph()).isEqualTo(graph.asGraph());

    for (Integer node : graph.nodes()) {

    assertThat(graph.isDirected()).isEqualTo(asNetwork.isDirected());
    assertThat(graph.allowsSelfLoops()).isEqualTo(asNetwork.allowsSelfLoops());
    assertThat(asNetwork.edgeOrder()).isEqualTo(ElementOrder.unordered());
    assertThat(asNetwork.allowsParallelEdges()).isFalse();
    assertThat(asNetwork.asGraph()).isEqualTo(graph);

    Set<EndpointPair<N>> allEndpointPairs = new HashSet<>();

    assertThat(graph.isDirected()).isEqualTo(asNetwork.isDirected());
    assertThat(graph.allowsSelfLoops()).isEqualTo(asNetwork.allowsSelfLoops());
    assertThat(asNetwork.edgeOrder()).isEqualTo(ElementOrder.unordered());
    assertThat(asNetwork.allowsParallelEdges()).isFalse();
    assertThat(asNetwork.asGraph()).isEqualTo(graph.asGraph());

    for (Integer node : graph.nodes()) {