assertThat(network.incidentEdges(node).size() + selfLoopCount)
            .isEqualTo(network.inDegree(node) + network.outDegree(node));
        assertThat(network.inEdges(node)).hasSize(network.inDegree(node));
        assertThat(network.outEdges(node)).hasSize(network.outDegree(node));
      } else {
        assertThat(network.predecessors(node)).isEqualTo(network.adjacentNodes(node));

    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentEdges(N1)).containsExactly(E11);
  }

  @Test
  public void incidentNodes_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentNodes(E11).source()).isEqualTo(N1);
    assertThat(network.incidentNodes(E11).target()).isEqualTo(N1);
  }

    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentEdges(N1)).containsExactly(E11);
  }

  @Test
  public void incidentNodes_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentNodes(E11).source()).isEqualTo(N1);
    assertThat(network.incidentNodes(E11).target()).isEqualTo(N1);
  }

{
    "properties": {
      "name": {
        "type": "keyword"
      },
      "paths": {
        "type": "keyword"
      },
      "includedPaths": {
        "type": "keyword"
      },
      "excludedPaths": {
        "type": "keyword"
      },
      "includedDocPaths": {
        "type": "keyword"
      },
      "excludedDocPaths": {
        "type": "keyword"
      },
      "configParameter": {

    network.addEdge(N1, N1, E11);
    network.addEdge(N1, N1, E11_A);
    assertThat(network.edgesConnecting(N1, N1)).containsExactly(E11, E11_A);
  }

  private static class NetworkForTest<N, E> extends AbstractNetwork<N, E> {
    private final Network<N, E> network;

    NetworkForTest(Network<N, E> network) {
      this.network = network;
    }

      MutableNetwork<Integer, Object> network =
          networkBuilder.allowsParallelEdges(true).allowsSelfLoops(true).build();

      assertThat(network.nodes()).isEmpty();
      assertThat(network.edges()).isEmpty();
      AbstractNetworkTest.validateNetwork(network);

      while (network.nodes().size() < NUM_NODES) {
        network.addNode(gen.nextInt(NODE_POOL_SIZE));
      }

      "name": {
        "type": "keyword"
      },
      "handlerName": {
        "type": "keyword"
      },
      "handlerParameter": {
        "type": "keyword"
      },
      "handlerScript": {
        "type": "keyword"
      },
      "boost": {
        "type": "float"
      },
      "available": {
        "type": "boolean"
      },
      "permissions": {
        "type": "keyword"
      },

    addEdges(network);

    assertThat(network.edgeOrder()).isEqualTo(ElementOrder.insertion());
    assertThat(network.edges()).containsExactly("i", "e", "p").inOrder();
    assertThat(network.nodeOrder()).isEqualTo(ElementOrder.insertion()); // default
  }

  // The default ordering is INSERTION unless otherwise specified.
  @Test
  public void edgeOrder_default() {

          },
          "userAgent" : {
            "type" : "keyword"
          },
          "userInfoId" : {
            "type" : "keyword"
          },
          "userSessionId" : {
            "type" : "keyword"
          },
          "virtualHost" : {
            "type" : "keyword"
          }
        }
      }
    },
    "settings" : {
      "index" : {
        "dbflute" : {

    "properties": {
      "user": {
        "type": "keyword"
      },
      "roles": {
        "type": "keyword"
      },
      "queryId": {
        "type": "keyword"
      },
      "searchWord": {
        "type": "keyword"
      },
      "requestedAt": {
        "type": "date",
        "format": "date_optional_time"
      },
      "responseTime": {
        "type": "long"
      },
      "queryTime": {