/*jshint globalstrict:false, strict:false */
/*global assertEqual, assertTrue, assertFalse, fail */

////////////////////////////////////////////////////////////////////////////////
/// @brief test the general-graph class
///
/// @file
///
/// DISCLAIMER
///
/// Copyright 2010-2014 triagens GmbH, Cologne, Germany
///
/// Licensed under the Apache License, Version 2.0 (the "License");
/// you may not use this file except in compliance with the License.
/// You may obtain a copy of the License at
///
///     http://www.apache.org/licenses/LICENSE-2.0
///
/// Unless required by applicable law or agreed to in writing, software
/// distributed under the License is distributed on an "AS IS" BASIS,
/// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
/// See the License for the specific language governing permissions and
/// limitations under the License.
///
/// Copyright holder is triAGENS GmbH, Cologne, Germany
///
/// @author Florian Bartels, Michael Hackstein
/// @author Copyright 2014, triAGENS GmbH, Cologne, Germany
////////////////////////////////////////////////////////////////////////////////

var jsunity = require("jsunity");
var arangodb = require("@arangodb");
var db = arangodb.db;
var graph = require("@arangodb/general-graph");
var cluster;
var isOnServer = (typeof ArangoClusterComm === "object");
if (isOnServer) {
  cluster = require("@arangodb/cluster");
} else {
  cluster = {};
}
var ERRORS = arangodb.errors;

var _ = require("lodash");


////////////////////////////////////////////////////////////////////////////////
/// @brief test suite: general-graph Creation and edge definition
////////////////////////////////////////////////////////////////////////////////

function GeneralGraphCreationSuite() {
  'use strict';
  var rn = "UnitTestRelationName";
  var rn1 = "UnitTestRelationName1";
  var vn1 = "UnitTestVertices1";
  var vn2 = "UnitTestVertices2";
  var vn3 = "UnitTestVertices3";
  var vn4 = "UnitTestVertices4";
  var gn = "UnitTestGraph";
  var gn1 = "UnitTestGraph1";
  var gn2 = "UnitTestGraph2";
  var edgeDef = graph._edgeDefinitions(
    graph._relation(rn, [vn1], [vn1]),
    graph._relation(rn1,
      [vn1, vn2], [vn3, vn4]
    )
  );

  var gN1 = "UnitTestEdgeDefDeleteGraph1",
    gN2 = "UnitTestEdgeDefDeleteGraph2",
    ec1 = "UnitTestEdgeDefDeleteEdgeCol1",
    ec2 = "UnitTestEdgeDefDeleteEdgeCol2",
    ec3 = "UnitTestEdgeDefDeleteEdgeCol3",
    vc1 = "UnitTestEdgeDefDeleteVertexCol1",
    vc2 = "UnitTestEdgeDefDeleteVertexCol2",
    vc3 = "UnitTestEdgeDefDeleteVertexCol3",
    vc4 = "UnitTestEdgeDefDeleteVertexCol4",
    vc5 = "UnitTestEdgeDefDeleteVertexCol5",
    vc6 = "UnitTestEdgeDefDeleteVertexCol6";

  var sortEdgeDefinition = function (edgeDefinition) {
    return {
      collection: edgeDefinition.collection,
      from: edgeDefinition.from.slice().sort(),
      to: edgeDefinition.to.slice().sort()
    };
  };

  return {

    setUp: function () {
      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }
      try {
        graph._drop(gN2, true);
      } catch (ignore) {
      }

    },

    tearDown: function () {
      db._drop("UnitTestsGraphRenamed1");
      db._drop("UnitTestsGraphRenamed2");
      db._drop("UnitTestsGraphRenamed3");
      db._drop(ec1);
      db._drop(ec2);
      db._drop(ec3);
      db._drop(vc1);
      db._drop(vc2);
      db._drop(vc3);
      db._drop(vc4);
      db._drop(vc5);
      db._drop(vc6);
      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }
      try {
        graph._drop(gN2, true);
      } catch (ignore) {
      }
      if (db._collection("_graphs").exists(gn1)) {
        db._collection("_graphs").remove(gn1);
      }
      if (db._collection("_graphs").exists(gn2)) {
        db._collection("_graphs").remove(gn2);
      }
    },

////////////////////////////////////////////////////////////////////////////////
/// @brief test: rename
////////////////////////////////////////////////////////////////////////////////

    test_collectionRenameEdge: function () {
      if ((cluster && cluster.isCluster && cluster.isCluster()) || (!cluster || !cluster.isCluster)) {
        return;
      }

      graph._create(
        gN1,
        graph._edgeDefinitions(
          graph._relation(rn1, [vn2, vn1], [vn4, vn3])
        )
      );

      var doc = db._graphs.document(gN1);
      assertEqual(1, doc.edgeDefinitions.length);
      assertEqual(rn1, doc.edgeDefinitions[0].collection);
      assertEqual(2, doc.edgeDefinitions[0].from.length);
      assertEqual([vn1, vn2], doc.edgeDefinitions[0].from.sort());
      assertEqual(2, doc.edgeDefinitions[0].to.length);
      assertEqual([vn3, vn4], doc.edgeDefinitions[0].to.sort());
      assertEqual([], doc.orphanCollections);

      db._collection(rn1).rename("UnitTestsGraphRenamed1");

      doc = db._graphs.document(gN1);
      assertEqual(1, doc.edgeDefinitions.length);
      assertEqual("UnitTestsGraphRenamed1", doc.edgeDefinitions[0].collection);
      assertEqual(2, doc.edgeDefinitions[0].from.length);
      assertEqual([vn1, vn2], doc.edgeDefinitions[0].from.sort());
      assertEqual(2, doc.edgeDefinitions[0].to.length);
      assertEqual([vn3, vn4], doc.edgeDefinitions[0].to.sort());
      assertEqual([], doc.orphanCollections);
    },

////////////////////////////////////////////////////////////////////////////////
/// @brief test: rename
////////////////////////////////////////////////////////////////////////////////

    test_collectionRenameVertex: function () {
      if ((cluster && cluster.isCluster && cluster.isCluster()) || (!cluster || !cluster.isCluster)) {
        return;
      }

      graph._create(
        gN1,
        graph._edgeDefinitions(
          graph._relation(rn1, [vn2, vn1], [vn4, vn3])
        )
      );

      db._collection(vn1).rename("UnitTestsGraphRenamed1");

      var doc = db._graphs.document(gN1);
      assertEqual(1, doc.edgeDefinitions.length);
      assertEqual(rn1, doc.edgeDefinitions[0].collection);
      assertEqual(2, doc.edgeDefinitions[0].from.length);
      assertEqual(["UnitTestsGraphRenamed1", vn2].sort(), doc.edgeDefinitions[0].from.sort());
      assertEqual(2, doc.edgeDefinitions[0].to.length);
      assertEqual([vn3, vn4], doc.edgeDefinitions[0].to.sort());
      assertEqual([], doc.orphanCollections);
    },

////////////////////////////////////////////////////////////////////////////////
/// @brief test: rename
////////////////////////////////////////////////////////////////////////////////

    test_collectionRenameVertices: function () {
      if ((cluster && cluster.isCluster && cluster.isCluster()) || (!cluster || !cluster.isCluster)) {
        return;
      }

      graph._create(
        gN1,
        graph._edgeDefinitions(
          graph._relation(rn1, [vn2, vn1], [vn4, vn3])
        )
      );

      db._collection(rn1).rename("UnitTestsGraphRenamed1");
      db._collection(vn1).rename("UnitTestsGraphRenamed2");
      db._collection(vn4).rename("UnitTestsGraphRenamed3");

      var doc = db._graphs.document(gN1);
      assertEqual(1, doc.edgeDefinitions.length);
      assertEqual("UnitTestsGraphRenamed1", doc.edgeDefinitions[0].collection);
      assertEqual(2, doc.edgeDefinitions[0].from.length);
      assertEqual(["UnitTestsGraphRenamed2", vn2].sort(), doc.edgeDefinitions[0].from.sort());
      assertEqual(2, doc.edgeDefinitions[0].to.length);
      assertEqual([vn3, "UnitTestsGraphRenamed3"].sort(), doc.edgeDefinitions[0].to.sort());
      assertEqual([], doc.orphanCollections);
    },

////////////////////////////////////////////////////////////////////////////////
/// @brief test: rename with module function renameCollection
////////////////////////////////////////////////////////////////////////////////

    test_collectionRenameCollectionsWithModule1: function () {
      // tests edge collection name from vertex and to vertex collections
      if ((cluster && cluster.isCluster && cluster.isCluster()) || (!cluster || !cluster.isCluster)) {
        return;
      }

      graph._create(
        gN1,
        graph._edgeDefinitions(
          graph._relation(rn1, [vn2, vn1], [vn4, vn3])
        )
      );

      graph._renameCollection("UnitTestRelationName1", "UnitTestsGraphRenamed1");
      graph._renameCollection("UnitTestVertices1", "UnitTestsGraphRenamed2");
      graph._renameCollection("UnitTestVertices4", "UnitTestsGraphRenamed3");

      var doc = db._graphs.document(gN1);
      assertEqual(1, doc.edgeDefinitions.length);
      assertEqual("UnitTestsGraphRenamed1", doc.edgeDefinitions[0].collection);
      assertEqual(2, doc.edgeDefinitions[0].from.length);
      assertEqual(["UnitTestsGraphRenamed2", vn2].sort(), doc.edgeDefinitions[0].from.sort());
      assertEqual(2, doc.edgeDefinitions[0].to.length);
      assertEqual([vn3, "UnitTestsGraphRenamed3"].sort(), doc.edgeDefinitions[0].to.sort());
      assertEqual([], doc.orphanCollections);
    },

    test_collectionRenameCollectionsWithModule2: function () {
      // tests orpahns rename in one graph
      if ((cluster && cluster.isCluster && cluster.isCluster()) || (!cluster || !cluster.isCluster)) {
        return;
      }

      graph._create(
        gN1,
        graph._edgeDefinitions(
          graph._relation(rn1, [vn2, vn1], [vn4, vn3])
        )
      );
      graph._create(
        gN2,
        graph._edgeDefinitions(
          graph._relation(rn1, [vn2, vn1], [vn4, vn3])
        )
      );

      var g1 = graph._graph(gN1);
      g1._addVertexCollection("mj7");
      var g2 = graph._graph(gN2);
      g2._addVertexCollection("mj7");

      graph._renameCollection("mj7", "MarcelJansen");

      var doc = db._graphs.document(gN1);
      assertEqual(1, doc.orphanCollections.length);
      assertEqual("MarcelJansen", doc.orphanCollections[0]);
      graph._drop(gN1, true);

      // should also be renamend in a different graph
      var docx = db._graphs.document(gN2);
      assertEqual(1, docx.orphanCollections.length);
      assertEqual("MarcelJansen", docx.orphanCollections[0]);
      graph._drop(gN2, true);

      // drop renamed gone connection
      db._drop("mj7");
    },

////////////////////////////////////////////////////////////////////////////////
/// @brief test: Graph Creation
////////////////////////////////////////////////////////////////////////////////

    test_undirectedRelation: function () {
      var r = graph._relation(rn, [vn1, vn2], [vn1, vn2]);

      assertEqual(r, {
        collection: rn,
        from: [vn1, vn2],
        to: [vn1, vn2]
      });

    },

    test_undirectedRelationWithSingleCollection: function () {
      var r = graph._relation(rn, vn1, vn1);

      assertEqual(r, {
        collection: rn,
        from: [vn1],
        to: [vn1]
      });

    },

    test_undirectedRelationWithMissingName: function () {
      try {
        graph._relation("", [vn1, vn2], [vn1, vn2]);
        fail();
      } catch (err) {
        assertEqual(err.errorMessage, "Invalid parameter type. arg1 must be non empty string");
      }
    },

    test_relationWithTooFewArgs: function () {
      try {
        graph._relation([vn1, vn2]);
        fail();
      } catch (err) {
        assertEqual(err.errorMessage, "Invalid number of arguments. Expected: 3");
      }
    },

    test_collectionSorting: function () {
      var g = graph._create(
        gn,
        graph._edgeDefinitions(
          graph._relation(rn1, [vn2, vn1], [vn4, vn3])
        )
      );

      assertEqual([vn1, vn2], g.__edgeDefinitions[0].from);
      assertEqual([vn3, vn4], g.__edgeDefinitions[0].to);
    },

    test_directedRelation: function () {
      var r = graph._relation(rn,
        [vn1, vn2], [vn3, vn4]);

      assertEqual(r, {
        collection: rn,
        from: [vn1, vn2],
        to: [vn3, vn4]
      });

    },

    test_directedRelationWithMissingName: function () {
      try {
        graph._relation("",
          [vn1, vn2], [vn3, vn4]);
        fail();
      } catch (err) {
        assertEqual(err.errorMessage, "Invalid parameter type. arg1 must be non empty string");
      }
    },

    test_directedRelationWithTooFewArgs: function () {
      try {
        graph._relation([vn1, vn2], [vn3, vn4]);
        fail();
      } catch (err) {
        assertEqual(err.errorMessage, "Invalid number of arguments. Expected: 3");
      }
    },

    test_relationWithInvalidSecondArg: function () {
      try {
        var param = {};
        param[vn1] = vn2;
        graph._relation(rn, param, vn3);
        fail();
      } catch (err) {
        assertEqual(err.errorMessage, "Invalid parameter type. arg2 must be non empty string or array");
      }


    },

    test_relationWithInvalidThirdArg: function () {
      try {
        var param = {};
        param[vn1] = vn2;
        graph._relation(rn, vn3, param);
        fail();
      } catch (err) {
        assertEqual(err.errorMessage, "Invalid parameter type. arg3 must be non empty string or array");
      }
    },

    testEdgeDefinitions: function () {

      //with empty args
      assertEqual(graph._edgeDefinitions(), []);

      //with args
      assertEqual(graph._edgeDefinitions(
        graph._relation(rn, vn1, vn1),
        graph._relation(rn1,
          [vn1, vn2], [vn3, vn4])
      ), [
        {
          collection: rn,
          from: [vn1],
          to: [vn1]
        },
        {
          collection: rn1,
          from: [vn1, vn2],
          to: [vn3, vn4]
        }
      ]);
    },

    testExtendEdgeDefinitions: function () {
      //with empty args
      assertEqual(graph._edgeDefinitions(), []);

      //with args
      var ed = graph._edgeDefinitions(
        graph._relation("relationName", "vertexC1", "vertexC1"),
        graph._relation("relationName",
          ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"])
      );
      graph._extendEdgeDefinitions(ed,
        graph._relation("relationName", "vertexC1", "vertexC1")
      );
      assertEqual(ed, [
        {
          collection: "relationName",
          from: ["vertexC1"],
          to: ["vertexC1"]
        },
        {
          collection: "relationName",
          from: ["vertexC1", "vertexC2"],
          to: ["vertexC3", "vertexC4"]
        },
        {
          collection: "relationName",
          from: ["vertexC1"],
          to: ["vertexC1"]
        }
      ]);
    },

    test_create: function () {
      if (db._collection("_graphs").exists(gn)) {
        db._collection("_graphs").remove(gn);
      }
      var a = graph._create(
        gn,
        graph._edgeDefinitions(
          graph._relation(rn, vn1, vn1),
          graph._relation(rn1, [vn1, vn2], [vn3, vn4])
        )
      );
      assertTrue(a.__vertexCollections.hasOwnProperty(vn1));
      assertTrue(a.__vertexCollections.hasOwnProperty(vn2));
      assertTrue(a.__vertexCollections.hasOwnProperty(vn3));
      assertTrue(a.__vertexCollections.hasOwnProperty(vn4));
      assertTrue(a.__edgeCollections.hasOwnProperty(rn));
      assertTrue(a.__edgeCollections.hasOwnProperty(rn1));
      assertEqual(a.__edgeDefinitions, [
          {
            "collection": rn,
            "from": [
              vn1
            ],
            "to": [
              vn1
            ]
          },
          {
            "collection": rn1,
            "from": [
              vn1,
              vn2
            ],
            "to": [
              vn3,
              vn4
            ]
          }
        ]
      );
    },

    test_create_WithOut_EdgeDefiniton: function () {
      if (db._collection("_graphs").exists(gn)) {
        db._collection("_graphs").remove(gn);
      }
      var g = graph._create(
        gn
      );
      assertEqual(g.__edgeDefinitions, []);
    },

    test_create_WithEmpty_from_to_EdgeDefiniton: function () {
      if (db._collection("_graphs").exists(gn)) {
        db._collection("_graphs").remove(gn);
      }

      // EdgeDefinition with empty from and to array
      var edgeDef = graph._edgeDefinitions({
        "collection": "IhaveNoFromsOrTos",
        "from": [],
        "to": []
      });

      try {
        graph._create(
          gn,
          edgeDef,
          [],
          {
            numberOfShards: 4,
            smartGraphAttribute: "smart"
          }
        );
      } catch (err) {
        assertEqual(err.errorMessage, ERRORS.ERROR_GRAPH_CREATE_MALFORMED_EDGE_DEFINITION.message);
      }
    },

    test_create_WithOut_Name: function () {
      if (db._collection("_graphs").exists(gn)) {
        db._collection("_graphs").remove(gn);
      }
      try {
        graph._create(
          "",
          graph._edgeDefinitions(
            graph._relation("relationName", "vertexC1", "vertexC1"),
            graph._relation("relationName2",
              ["vertexC1", "vertexC2"], ["vertexC3", "vertexC4"]
            )
          )
        );
        fail();
      } catch (err) {
        assertEqual(err.errorMessage, ERRORS.ERROR_GRAPH_CREATE_MISSING_NAME.message);
      }
    },

    test_create_With_Already_Existing_Graph: function () {
      if (db._collection("_graphs").exists(gn)) {
        db._collection("_graphs").remove(gn);
      }
      graph._create(gn, edgeDef);
      try {
        graph._create(gn, edgeDef);
      } catch (err) {
        assertEqual(err.errorNum, ERRORS.ERROR_GRAPH_DUPLICATE.code);
        assertEqual(err.errorMessage, ERRORS.ERROR_GRAPH_DUPLICATE.message);
      }
    },

    // Graphs may have overlapping edge collections, as long as their
    // definitions are equal.
    // This is also a regression test for a broken comparison of edge
    // definitions, which did rely on the edge definition object's key order
    // and thus sometimes reported spurious inequality.
    test_createGraphsWithOverlappingEdgeDefinitions: function () {
      if (db._collection("_graphs").exists(gn)) {
        db._collection("_graphs").remove(gn);
      }
      // try to provoke differently ordered keys in
      // edge definitions that are actually equal.
      const edgeDefs1 = [
        {
          collection: rn,
          from: [vn1],
          to: [vn1],
        },
      ];
      const edgeDefs2 = [
        {
          to: [vn1],
          from: [vn1],
          collection: rn,
        },
      ];
      graph._create(gn1, edgeDefs1);
      graph._create(gn2, edgeDefs2);
    },

    // Graphs may have overlapping edge collections, as long as their
    // definitions are equal.
    // This is also a regression test for a broken comparison of edge
    // definitions, which did rely on the edge definition's from and to
    // arrays to be ordered.
    test_createGraphsWithLargeOverlappingEdgeDefinitions: function () {
      if (db._collection("_graphs").exists(gn)) {
        db._collection("_graphs").remove(gn);
      }
      // try to provoke differently ordered from and to arrays in
      // edge definitions that are actually equal.
      const edgeDefs1 = [
        {
          collection: rn,
          from: [vn1, vn2, vn3, vn4],
          to: [vn2, vn1, vn4, vn3],
        },
      ];
      const edgeDefs2 = [
        {
          collection: rn,
          from: [vn4, vn3, vn2, vn1],
          to: [vn3, vn4, vn1, vn2],
        },
      ];
      graph._create(gn1, edgeDefs1);
      graph._create(gn2, edgeDefs2);
    },

    test_get_graph: function () {
      if (db._collection("_graphs").exists(gn)) {
        db._collection("_graphs").remove(gn);
      }
      graph._create(gn, edgeDef);
      var a = graph._graph(gn);

      assertTrue(a.__vertexCollections.hasOwnProperty(vn1));
      assertTrue(a.__vertexCollections.hasOwnProperty(vn2));
      assertTrue(a.__vertexCollections.hasOwnProperty(vn3));
      assertTrue(a.__vertexCollections.hasOwnProperty(vn4));
      assertTrue(a.__edgeCollections.hasOwnProperty(rn));
      assertTrue(a.__edgeCollections.hasOwnProperty(rn1));
      assertEqual(a.__edgeDefinitions, [
          {
            "collection": rn,
            "from": [
              vn1
            ],
            "to": [
              vn1
            ]
          },
          {
            "collection": rn1,
            "from": [
              vn1,
              vn2
            ],
            "to": [
              vn3,
              vn4
            ]
          }
        ]
      );
    },

    test_get_graph_without_hit: function () {
      try {
        graph._graph(gn + "UnknownExtension");
        fail();
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_GRAPH_NOT_FOUND.code);
        assertEqual(e.errorMessage, "graph 'UnitTestGraphUnknownExtension' not found");
      }
    },

    test_creationOfGraphShouldNotAffectCollections: function () {
      if (graph._exists(gn)) {
        graph._drop(gn, true);
      }
      var edgeDef2 = [graph._relation(rn, vn1, vn2)];
      var g = graph._create(gn, edgeDef2);
      var v1 = g[vn1].save({_key: "1"})._id;
      var v2 = g[vn2].save({_key: "2"})._id;
      var v3 = g[vn1].save({_key: "3"})._id;

      g[rn].save(v1, v2, {});
      assertEqual(g[vn1].count(), 2);
      assertEqual(g[vn2].count(), 1);
      assertEqual(g[rn].count(), 1);
      try {
        g[rn].save(v2, v3, {});
        fail();
      } catch (e) {
        // This should create an error
        assertEqual(g[rn].count(), 1);
      }

      try {
        db[rn].save(v2, v3, {});
      } catch (e) {
        // This should not create an error
        fail();
      }
      assertEqual(g[rn].count(), 2);

      db[vn2].remove(v2);
      // This should not remove edges
      assertEqual(g[rn].count(), 2);

      g[vn1].remove(v1);
      // This should remove edges
      assertEqual(g[rn].count(), 1);
      graph._drop(gn, true);
    },


    test_deleteEdgeDefinitionFromExistingGraph1: function () {
      var dr1 = graph._relation(ec1, [vc1], [vc1, vc2]),
        g1 = graph._create(gN1, [dr1]);

      try {
        g1._deleteEdgeDefinition(ec1);
      } catch (e) {
        assertEqual(
          e.errorMessage,
          arangodb.errors.ERROR_GRAPH_EDGE_COLLECTION_NOT_USED.message
        );
      }

    },

    test_deleteEdgeDefinitionFromExistingGraph2: function () {

      var dr1 = graph._relation(ec1, [vc1], [vc1, vc2]),
        dr2 = graph._relation(ec2, [vc3], [vc4, vc5]),
        dr3 = graph._relation(ec3, [vc4], [vc5]),
        g1 = graph._create(gN1, [dr1, dr2, dr3]);

      assertEqual([dr1, dr2, dr3], g1.__edgeDefinitions);
      g1._deleteEdgeDefinition(ec1);
      assertEqual([dr2, dr3], g1.__edgeDefinitions);
      assertEqual([vc1, vc2], g1._orphanCollections());
      g1 = graph._graph(gN1); // reload
      assertEqual([dr2, dr3], g1.__edgeDefinitions);
      assertEqual([vc1, vc2], g1._orphanCollections());
      assertTrue(db._collection(ec1) !== null);

      g1._deleteEdgeDefinition(ec2);
      assertEqual([dr3], g1.__edgeDefinitions);
      assertEqual([vc1, vc2, vc3].sort(), g1._orphanCollections().sort());
      g1 = graph._graph(gN1); // reload
      assertEqual([dr3], g1.__edgeDefinitions);
      assertEqual([vc1, vc2, vc3].sort(), g1._orphanCollections().sort());
      assertTrue(db._collection(ec2) !== null);
    },

    test_deleteEdgeDefinitionFromExistingGraphAndDropIt: function () {

      var dr1 = graph._relation(ec1, [vc1], [vc1, vc2]),
        dr2 = graph._relation(ec2, [vc3], [vc4, vc5]),
        dr3 = graph._relation(ec3, [vc4], [vc5]),
        g1 = graph._create(gN1, [dr1, dr2, dr3]);

      assertEqual([dr1, dr2, dr3], g1.__edgeDefinitions);
      g1._deleteEdgeDefinition(ec1, true);
      assertEqual([dr2, dr3], g1.__edgeDefinitions);
      assertEqual([vc1, vc2], g1._orphanCollections());
      g1 = graph._graph(gN1); // reload
      assertEqual([dr2, dr3], g1.__edgeDefinitions);
      assertEqual([vc1, vc2], g1._orphanCollections());
      assertTrue(db._collection(ec1) === null);

      g1._deleteEdgeDefinition(ec2, true);
      assertEqual([dr3], g1.__edgeDefinitions);
      assertEqual([vc1, vc2, vc3].sort(), g1._orphanCollections().sort());
      g1 = graph._graph(gN1); // reload
      assertEqual([dr3], g1.__edgeDefinitions);
      assertEqual([vc1, vc2, vc3].sort(), g1._orphanCollections().sort());
      assertTrue(db._collection(ec2) === null);
    },

    test_extendEdgeDefinitionFromExistingGraph1: function () {

      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }

      var dr1 = graph._relation(ec1, [vc1], [vc2]),
        dr2 = graph._relation(ec1, [vc2], [vc3]),
        g1 = graph._create(gN1, [dr1]);

      try {
        g1._extendEdgeDefinitions(dr2);
        fail();
      } catch (e) {
        assertEqual(
          e.errorMessage,
          ec1 + " " + arangodb.errors.ERROR_GRAPH_COLLECTION_MULTI_USE.message
        );
      }

      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }

    },

    test_extendEdgeDefinitionFromExistingGraph2: function () {

      var dr1 = graph._relation(ec1, [vc1], [vc1, vc2]),
        dr2 = graph._relation(ec2, [vc3], [vc4, vc5]),
        dr2a = graph._relation(ec2, [vc3], [vc4]),
        g1 = graph._create(gN1, [dr1]);
      graph._create(gN2, [dr2]);

      try {
        g1._extendEdgeDefinitions(dr2a);
      } catch (e) {
        assertEqual(
          e.errorMessage,
          ec2 + " " + arangodb.errors.ERROR_GRAPH_COLLECTION_USE_IN_MULTI_GRAPHS.message
        );
      }

      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }
      try {
        graph._drop(gN2, true);
      } catch (ignore) {
      }

    },

    test_extendEdgeDefinitionFromExistingGraph3: function () {
      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }
      try {
        graph._drop(gN2, true);
      } catch (ignore) {
      }

      var dr1 = graph._relation(ec1, [vc1], [vc1, vc2]),
        dr2 = graph._relation(ec2, [vc3], [vc4, vc5]),
        dr3 = graph._relation(ec3, [vc3], [vc4]),
        g1 = graph._create(gN1, [dr1]);
      graph._create(gN2, [dr2]);

      const loadG1 = () => graph._graph(gN1);
      let sortEdgeDefinitions = function (a, b) {
        if (a.collection < b.collection) {
          return -1;
        }
        if (a.collection > b.collection) {
          return 1;
        }
        return 0;
      };

      assertEqual([dr1], g1.__edgeDefinitions);
      g1._addVertexCollection(vc3);
      assertEqual([vc3], g1._orphanCollections());
      assertEqual([vc3], loadG1()._orphanCollections());
      g1._extendEdgeDefinitions(dr3);
      assertEqual([dr1, dr3].sort(sortEdgeDefinitions), g1.__edgeDefinitions);
      assertEqual([dr1, dr3].sort(sortEdgeDefinitions), loadG1().__edgeDefinitions);
      assertEqual([], g1._orphanCollections());
      assertEqual([], loadG1()._orphanCollections());
      g1._extendEdgeDefinitions(dr2);
      assertEqual([dr1, dr3, dr2].sort(sortEdgeDefinitions), g1.__edgeDefinitions);
      assertEqual([dr1, dr3, dr2].sort(sortEdgeDefinitions), loadG1().__edgeDefinitions);
    },

    test_extendEdgeDefinitionFromExistingGraph4: function () {
      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }
      try {
        graph._drop(gN2, true);
      } catch (ignore) {
      }

      var dr1 = graph._relation(ec1, [vc1], [vc1, vc2]),
        dr2 = graph._relation(ec2, [vc4, vc3, vc1, vc2], [vc4, vc3, vc1, vc2]),
        g1 = graph._create(gN1, [dr1]);

      const loadG1 = () => graph._graph(gN1);

      g1._extendEdgeDefinitions(dr2);
      dr1 = sortEdgeDefinition(dr1);
      dr2 = sortEdgeDefinition(dr2);
      assertEqual([dr1, dr2], g1.__edgeDefinitions);
      assertEqual([dr1, dr2], loadG1().__edgeDefinitions);
      let edgeDefinition = _.find(g1.__edgeDefinitions, {collection: ec2});
      assertEqual(edgeDefinition.from, [vc1, vc2, vc3, vc4]);
      assertEqual(edgeDefinition.to, [vc1, vc2, vc3, vc4]);
      edgeDefinition = _.find(loadG1().__edgeDefinitions, {collection: ec2});
      assertEqual(edgeDefinition.from, [vc1, vc2, vc3, vc4]);
      assertEqual(edgeDefinition.to, [vc1, vc2, vc3, vc4]);
    },


    test_editEdgeDefinitionFromExistingGraph1: function () {
      var dr1 = graph._relation(ec1, [vc1], [vc1, vc2]),
        dr2 = graph._relation(ec2, [vc3], [vc4, vc5]),
        g1 = graph._create(gN1, [dr1]);

      try {
        g1._editEdgeDefinitions(dr2);
      } catch (e) {
        assertEqual(
          e.errorMessage,
          arangodb.errors.ERROR_GRAPH_EDGE_COLLECTION_NOT_USED.message
        );
      }

    },

    test_editEdgeDefinitionFromExistingGraph2: function () {

      var dr1 = graph._relation(ec1, _.cloneDeep([vc1, vc2]), _.cloneDeep([vc3, vc4])),
        dr2 = graph._relation(ec2, _.cloneDeep([vc1]), _.cloneDeep([vc4])),
        dr3 = graph._relation(ec1, _.cloneDeep([vc5]), _.cloneDeep([vc5])),
        g1 = graph._create(gN1, _.cloneDeep([dr1, dr2])),
        g2 = graph._create(gN2, _.cloneDeep([dr1]));

      g1._editEdgeDefinitions(_.cloneDeep(dr3));

      g1 = graph._graph(gN1);
      g2 = graph._graph(gN2);

      assertEqual([dr3, dr2], g1.__edgeDefinitions);
      assertEqual([dr3], g2.__edgeDefinitions);

      assertEqual(g1._orphanCollections().sort(), [vc2, vc3].sort());
      assertEqual(g2._orphanCollections().sort(), [vc1, vc2, vc3, vc4].sort());
    },

    test_editEdgeDefinitionFromExistingGraph3: function () {
      var dr1 = graph._relation(ec1, _.cloneDeep([vc1]), _.cloneDeep([vc1, vc2])),
        dr2 = graph._relation(ec1, _.cloneDeep([vc3]), _.cloneDeep([vc4, vc5])),
        dr3 = graph._relation(ec2, _.cloneDeep([vc2]), _.cloneDeep([vc2, vc3])),
        g1 = graph._create(gN1, _.cloneDeep([dr1, dr3])),
        g2 = graph._create(gN2, _.cloneDeep([dr1]));

      g1._addVertexCollection(vc4);
      g2._addVertexCollection(vc5);
      g2._addVertexCollection(vc6);
      g1._editEdgeDefinitions(dr2);

      g2 = graph._graph(gN2);
      g1 = graph._graph(gN1);

      assertEqual([dr2, dr3], g1.__edgeDefinitions);
      assertEqual([dr2], g2.__edgeDefinitions);
      assertEqual([vc1], g1._orphanCollections());
      assertEqual(g2._orphanCollections().sort(), [vc1, vc2, vc6].sort());

      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }
      try {
        graph._drop(gN2, true);
      } catch (ignore) {
      }
    },

    test_createGraphAndDropAVertexCollectionAfterwards: function () {
      try {
        var gr = graph._create("gg",
          [graph._relation("edges", "verts", "verts")],
          ["other"]
        );
        assertTrue(db["other"].name() === "other");
        gr._removeVertexCollection("other", true);
        var collections = db._collections();
        var found = false;
        _.each(collections, function (collection) {
          if (collection.name() === "other") {
            found = true;
          }
        });
        assertFalse(found);
      } finally {
        graph._drop("gg", true);
      }
    },
  };
}

function EdgesAndVerticesSuite() {
  'use strict';

  var g;
  var vertexId1, vertexId2;
  var unitTestGraphName = "unitTestGraph";

  var ec1 = "unitTestEdgeCollection1";
  var ec2 = "unitTestEdgeCollection2";
  var vc1 = "unitTestVertexCollection1";
  var vc2 = "unitTestVertexCollection2";
  var vc3 = "unitTestVertexCollection3";
  var vc4 = "unitTestVertexCollection4";

  var ids = {};

  var fillCollections = function () {
    var vertex = g[vc1].save({first_name: "Tam"});
    ids.vId11 = vertex._id;
    vertex = g[vc1].save({first_name: "Tem"});
    ids.vId12 = vertex._id;
    vertex = g[vc1].save({first_name: "Tim"});
    ids.vId13 = vertex._id;
    vertex = g[vc1].save({first_name: "Tom"});
    ids.vId14 = vertex._id;
    vertex = g[vc1].save({first_name: "Tum"});
    ids.vId15 = vertex._id;
    vertex = g[vc3].save({first_name: "Tam"});
    ids.vId31 = vertex._id;
    vertex = g[vc3].save({first_name: "Tem"});
    ids.vId32 = vertex._id;
    vertex = g[vc3].save({first_name: "Tim"});
    ids.vId33 = vertex._id;
    vertex = g[vc3].save({first_name: "Tom"});
    ids.vId34 = vertex._id;
    vertex = g[vc3].save({first_name: "Tum"});
    ids.vId35 = vertex._id;

    var edge = g[ec1].save(ids.vId11, ids.vId12, {});
    ids.eId11 = edge._id;
    edge = g[ec1].save(ids.vId11, ids.vId13, {});
    ids.eId12 = edge._id;
    edge = g[ec1].save(ids.vId11, ids.vId14, {});
    ids.eId13 = edge._id;
    edge = g[ec1].save(ids.vId11, ids.vId15, {});
    ids.eId14 = edge._id;
    edge = g[ec1].save(ids.vId12, ids.vId11, {});
    ids.eId15 = edge._id;
    edge = g[ec1].save(ids.vId13, ids.vId11, {});
    ids.eId16 = edge._id;
    edge = g[ec1].save(ids.vId14, ids.vId11, {});
    ids.eId17 = edge._id;
    edge = g[ec1].save(ids.vId15, ids.vId11, {});
    ids.eId18 = edge._id;
    edge = g[ec2].save(ids.vId11, ids.vId31, {});
    ids.eId21 = edge._id;
    edge = g[ec2].save(ids.vId11, ids.vId32, {});
    ids.eId22 = edge._id;
    edge = g[ec2].save(ids.vId11, ids.vId33, {});
    ids.eId23 = edge._id;
    edge = g[ec2].save(ids.vId11, ids.vId34, {});
    ids.eId24 = edge._id;
    edge = g[ec2].save(ids.vId11, ids.vId35, {});
    ids.eId25 = edge._id;
    return ids;
  };

  var pickStartByName = function (name) {
    var exampleFilter = `FILTER x.first_name == "${name}" RETURN x`;
    return `FOR start IN UNION(
       (FOR x IN ${vc1} ${exampleFilter}),
       (FOR x IN ${vc2} ${exampleFilter}),
       (FOR x IN ${vc3} ${exampleFilter}),
       (FOR x IN ${vc4} ${exampleFilter}))`;

  };

  return {

    setUp: function () {
      try {
        graph._drop(unitTestGraphName, true);
      } catch (ignore) {
      }
      g = graph._create(
        unitTestGraphName,
        graph._edgeDefinitions(
          graph._relation(ec1, vc1, vc1),
          graph._relation(ec2,
            [vc1, vc2], [vc3, vc4]
          )
        )
      );
    },

    tearDown: function () {
      graph._drop(unitTestGraphName, true);
    },

    test_connectingEdges: function () {
      fillCollections();
      var query = `${pickStartByName("Tam")} FOR v, e IN ANY start GRAPH "${unitTestGraphName}" FILTER v.first_name == "Tem" RETURN e`;
      var res = db._query(query).toArray();
      assertEqual(res.length, 3);
    },

    test_connectingEdgesWithEdgeCollectionRestriction: function () {
      fillCollections();
      var query = `${pickStartByName("Tam")} FOR v, e IN ANY start GRAPH "${unitTestGraphName}" RETURN DISTINCT e`;
      var res = db._query(query).toArray();
      assertEqual(res.length, 13);

      query = `${pickStartByName("Tam")} FOR v, e IN ANY start ${ec2} RETURN DISTINCT e`;
      res = db._query(query).toArray();
      assertEqual(res.length, 5);
    },

    test_connectingEdgesWithVertexCollectionRestriction: function () {
      fillCollections();
      var query = `FOR start IN ${vc1} FOR v, e IN ANY start GRAPH "${unitTestGraphName}" RETURN DISTINCT e`;
      var res = db._query(query).toArray();
      assertEqual(res.length, 13);
      query = `FOR start IN ${vc1} FOR v, e IN ANY start GRAPH "${unitTestGraphName}" FILTER IS_SAME_COLLECTION("${vc3}", v) RETURN DISTINCT e`;
      res = db._query(query).toArray();
      assertEqual(res.length, 5);
    },

    test_connectingEdgesWithIds: function () {
      var ids = fillCollections();
      var query = `FOR v, e IN ANY "${ids.vId11}" GRAPH "${unitTestGraphName}" FILTER v._id == "${ids.vId13}" RETURN e`;
      var res = db._query(query).toArray();
      assertEqual(res.length, 2);
    },

    test_dropGraph1: function () {
      var myGraphName = unitTestGraphName + "2";
      var myEdgeColName = "unitTestEdgeCollection4711";
      var myVertexColName = vc1;

      graph._create(
        myGraphName,
        graph._edgeDefinitions(
          graph._relation(myEdgeColName, myVertexColName, myVertexColName)
        )
      );

      graph._drop(myGraphName, true);
      assertFalse(graph._exists(myGraphName));
      db._flushCache();
      assertTrue(db._collection(myVertexColName) !== null);
      assertTrue(db._collection(myEdgeColName) === null);
    },

    test_dropGraph2: function () {
      var myGraphName = unitTestGraphName + "2";
      var myEdgeColName = "unitTestEdgeCollection4711";
      var myVertexColName = vc1;
      graph._create(
        myGraphName,
        graph._edgeDefinitions(
          graph._relation(myEdgeColName, myVertexColName, myVertexColName)
        )
      );
      graph._drop(myGraphName);
      assertFalse(graph._exists(myGraphName));
      assertTrue(db._collection(myVertexColName) !== null);
      assertTrue(db._collection(myEdgeColName) !== null);
    },

    test_createGraphWithCollectionDuplicateOK: function () {
      var myGraphName = unitTestGraphName + "2";
      graph._create(
        myGraphName,
        graph._edgeDefinitions(
          graph._relation(ec1, vc1, vc1)
        )
      );
      assertTrue(graph._exists(myGraphName));
      graph._drop(myGraphName, true);
      assertFalse(graph._exists(myGraphName));
      assertTrue(db._collection(vc1) !== null);
      assertTrue(db._collection(ec1) !== null);
    },

    test_createGraphWithMalformedEdgeDefinitions: function () {
      var myGraphName = unitTestGraphName + "2";
      try {
        graph._create(
          myGraphName,
          ["foo"]
        );
      } catch (e) {
        assertEqual(
          e.errorMessage,
          arangodb.errors.ERROR_GRAPH_CREATE_MALFORMED_EDGE_DEFINITION.message
        );
      }
      assertFalse(graph._exists(myGraphName));
    },

    test_createGraphWithCollectionDuplicateNOK1: function () {
      var myGraphName = unitTestGraphName + "2";
      try {
        graph._create(
          myGraphName,
          graph._edgeDefinitions(
            graph._relation(ec1, vc2, vc2)
          )
        );
      } catch (e) {
        assertEqual(
          e.errorMessage,
          ec1 + " " + arangodb.errors.ERROR_GRAPH_COLLECTION_USE_IN_MULTI_GRAPHS.message
        );
      }
      assertFalse(graph._exists(myGraphName));
      assertTrue(db._collection(vc2) !== null);
      assertTrue(db._collection(ec1) !== null);
    },

    test_createGraphWithCollectionDuplicateNOK2: function () {
      var myGraphName = unitTestGraphName + "2";
      var myED = "unitTestEdgeCollection4711";
      var myVD1 = "unitTestVertexCollection4711";
      var myVD2 = "unitTestVertexCollection4712";
      try {
        graph._drop(myGraphName, true);
      } catch (ignore) {
      }
      try {
        db._drop(myED);
      } catch (ignore) {
      }
      try {
        graph._create(
          myGraphName,
          graph._edgeDefinitions(
            graph._relation(myED, myVD1, myVD1),
            graph._relation(myED, myVD2, myVD2)
          )
        );
        fail();
      } catch (e) {
        assertEqual(e.errorNum, arangodb.errors.ERROR_GRAPH_COLLECTION_MULTI_USE.code);
      }
      assertFalse(graph._exists(myGraphName));
      assertTrue(db._collection(myVD1) === null);
      assertTrue(db._collection(myVD2) === null);
      assertTrue(db._collection(myED) === null);
    },

    test_edgeCollections: function () {

      var edgeCollections = g._edgeCollections();
      assertEqual(edgeCollections[0].name(), ec1);
      assertEqual(edgeCollections[1].name(), ec2);
    },

    test_vertexCollections: function () {

      var vertexCollections = g._vertexCollections();
      assertEqual(vertexCollections[0].name(), vc1);
      assertEqual(vertexCollections[1].name(), vc2);
      assertEqual(vertexCollections[2].name(), vc3);
      assertEqual(vertexCollections[3].name(), vc4);
    },

    test_vC_save: function () {
      var vertex = g[vc1].save({first_name: "Tom"});
      assertFalse(vertex.error);
      vertexId1 = vertex._id;
      var vertexObj = g[vc1].document(vertexId1);
      assertEqual(vertexObj.first_name, "Tom");
    },

    test_vC_replace: function () {
      var vertex = g[vc1].save({first_name: "Tom"});
      var vertexId = vertex._id;
      vertex = g[vc1].replace(vertexId, {first_name: "Tim"});
      assertFalse(vertex.error);
      var vertexObj = g[vc1].document(vertexId);
      assertEqual(vertexObj.first_name, "Tim");
    },

    test_vC_update: function () {
      var vertex = g[vc1].save({first_name: "Tim"});
      var vertexId = vertex._id;
      vertex = g[vc1].update(vertexId, {age: 42});
      assertFalse(vertex.error);
      var vertexObj = g[vc1].document(vertexId);
      assertEqual(vertexObj.first_name, "Tim");
      assertEqual(vertexObj.age, 42);
    },

    test_vC_remove: function () {
      var col = g[vc1];
      var counter = col.count();
      var vertex = col.save({first_name: "Tim"});
      assertEqual(col.count(), counter + 1);
      var vertexId = vertex._id;
      var result = col.remove(vertexId);
      assertEqual(col.count(), counter);
      assertTrue(result);
    },

    test_vC_remove_by_key: function () {
      var col = g[vc1];
      var counter = col.count();
      var vertex = col.save({first_name: "Tim"});
      assertEqual(col.count(), counter + 1);
      var vertexId = vertex._key;
      var result = col.remove(vertexId);
      assertEqual(col.count(), counter);
      assertTrue(result);
    },

    test_vC_removeWithEdge: function () {
      var vertex1 = g[vc1].save({first_name: "Tim"});
      var vId1 = vertex1._id;
      var vertex2 = g[vc1].save({first_name: "Tom"});
      var vId2 = vertex2._id;
      var edge = g[ec1].save(vId1, vId2, {});
      var edgeId = edge._id;
      var result = g[vc1].remove(vId1);
      assertTrue(result);
      assertFalse(db[ec1].exists(edgeId));
      result = g[vc1].remove(vId2);
      assertTrue(result);
    },

    test_eC_save_undirected: function () {
      var vertex1 = g[vc1].save({first_name: "Tom"});
      var vId1 = vertex1._id;
      var vertex2 = g[vc1].save({first_name: "Tim"});
      var vId2 = vertex2._id;
      var edge = g[ec1].save(vertexId1, vId2, {});
      assertFalse(edge.error);

      edge = g[ec1].insert(vertexId1, vId2, {});
      assertFalse(edge.error);

      g[vc1].remove(vId1);
      g[vc1].remove(vId2);
    },

    test_eC_save_directed: function () {
      var vertex1 = g[vc2].save({first_name: "Tom"});
      vertexId1 = vertex1._id;
      var vertex2 = g[vc4].save({first_name: "Tim"});
      vertexId2 = vertex2._id;

      var edge = g[ec2].save(vertexId1, vertexId2, {});
      assertFalse(edge.error);

      edge = g[ec2].insert(vertexId1, vertexId2, {});
      assertFalse(edge.error);

      g[vc2].remove(vertexId1);
      g[vc4].remove(vertexId2);
    },

    test_eC_save_withError: function () {
      var vertex1 = g[vc1].save({first_name: "Tom"});
      vertexId1 = vertex1._id;
      var vertex2 = g[vc2].save({first_name: "Tim"});
      vertexId2 = vertex2._id;
      try {
        g[ec1].save(vertexId1, vertexId2, {});
        fail();
      } catch (e) {
        assertEqual(e.errorNum, arangodb.errors.ERROR_GRAPH_INVALID_EDGE.code);
      }

      try {
        g[ec1].insert(vertexId1, vertexId2, {});
        fail();
      } catch (e) {
        assertEqual(e.errorNum, arangodb.errors.ERROR_GRAPH_INVALID_EDGE.code);
      }

      g[vc1].remove(vertexId1);
      g[vc2].remove(vertexId2);
    },

    test_eC_replace: function () {
      var vertex1 = g[vc1].save({first_name: "Tom"});
      var vertexId1 = vertex1._id;
      var vertex2 = g[vc1].save({first_name: "Tim"});
      var vertexId2 = vertex2._id;
      var edge = g[ec1].save(vertexId1, vertexId2, {});
      var edgeId1 = edge._id;
      edge = g[ec1].replace(edgeId1, {_from: vertexId1, _to: vertexId2, label: "knows"});
      assertFalse(edge.error);
      var edgeObj = g[ec1].document(edgeId1);
      assertEqual(edgeObj.label, "knows");
      assertEqual(edgeObj._id, edgeId1);
    },

    test_eC_update: function () {
      var vertex1 = g[vc1].save({first_name: "Tom"});
      var vertexId1 = vertex1._id;
      var vertex2 = g[vc1].save({first_name: "Tim"});
      var vertexId2 = vertex2._id;
      var edge = g[ec1].save(vertexId1, vertexId2, {});
      var edgeId1 = edge._id;
      edge = g[ec1].replace(edgeId1, {_from: vertexId1, _to: vertexId2, label: "knows"});
      edge = g[ec1].update(edgeId1, {blub: "blub"});
      assertFalse(edge.error);
      var edgeObj = g[ec1].document(edgeId1);
      assertEqual(edgeObj.label, "knows");
      assertEqual(edgeObj.blub, "blub");
      assertEqual(edgeObj._id, edgeId1);
    },

    test_eC_remove: function () {
      var vertex1 = g[vc1].save({first_name: "Tom"});
      var vertexId1 = vertex1._id;
      var vertex2 = g[vc1].save({first_name: "Tim"});
      var vertexId2 = vertex2._id;
      var edge = g[ec1].save(vertexId1, vertexId2, {});
      var edgeId1 = edge._id;
      edge = g[ec1].remove(edgeId1);
      assertTrue(edge);
    },

    test_eC_remove_by_key: function () {
      var vertex1 = g[vc1].save({first_name: "Tom"});
      var vertexId1 = vertex1._id;
      var vertex2 = g[vc1].save({first_name: "Tim"});
      var vertexId2 = vertex2._id;
      var counter = g[ec1].count();
      var edge = g[ec1].save(vertexId1, vertexId2, {});
      assertEqual(g[ec1].count(), counter + 1);
      var edgeId1 = edge._key;
      edge = g[ec1].remove(edgeId1);
      assertTrue(edge);
      assertEqual(g[ec1].count(), counter);
    },

    test_eC_removeWithEdgesAsVertices: function () {

      var myGraphName = unitTestGraphName + "0815";
      var myEC02 = "unitTestEdgeCollection02";
      var myVC01 = "unitTestVertexCollection01";
      try {
        graph._drop(myGraphName, true);
        db._drop(myEC02);
        db._drop(myVC01);
      } catch (ignore) {
      }
      var g2 = graph._create(
        myGraphName,
        graph._edgeDefinitions(
          graph._relation(myEC02,
            [ec1], [myVC01]
          )
        )
      );
      var vertex1 = g[vc1].save({first_name: "Tom"});
      var vertexId1 = vertex1._id;
      var vertex2 = g[vc1].save({first_name: "Tim"});
      var vertexId2 = vertex2._id;
      var vertex3 = g2.unitTestVertexCollection01.save({first_name: "Ralph"});
      var vertexId3 = vertex3._id;
      var edge = g[ec1].save(vertexId1, vertexId2, {});
      var edge2 = g2.unitTestEdgeCollection02.save(edge._id, vertexId3, {});

      var edgeId1 = edge._id;
      edge = g[ec1].remove(edgeId1);
      assertTrue(edge);
      assertFalse(db._exists(edge2._id));
      graph._drop(myGraphName, true);
      assertFalse(graph._exists(myGraphName));
    },

    test_eC_removeWithEdgesAsVerticesCircle: function () {
      var gN1 = "unitTestGraphCircle1";
      var gN2 = "unitTestGraphCircle2";
      var gN3 = "unitTestGraphCircle3";
      var gN4 = "unitTestGraphCircle4";
      var eC1 = "unitTestEdgeCollectionCircle1";
      var eC2 = "unitTestEdgeCollectionCircle2";
      var eC3 = "unitTestEdgeCollectionCircle3";
      var eC4 = "unitTestEdgeCollectionCircle4";
      var vC1 = "unitTestVertexCollectionCircle1";
      var vC2 = "unitTestVertexCollectionCircle2";
      var vC3 = "unitTestVertexCollectionCircle3";
      var vC4 = "unitTestVertexCollectionCircle4";
      try {
        graph._drop(gN1, true);
        graph._drop(gN2, true);
        graph._drop(gN3, true);
        graph._drop(gN4, true);
        db._drop(eC1);
        db._drop(eC2);
        db._drop(eC3);
        db._drop(eC4);
        db._drop(vC1);
        db._drop(vC2);
        db._drop(vC3);
        db._drop(vC4);
      } catch (ignore) {
      }

      db._createEdgeCollection(eC1);
      db._createEdgeCollection(eC2);
      db._createEdgeCollection(eC3);
      db._createEdgeCollection(eC4);
      db._create(vC1);
      db._create(vC2);
      db._create(vC3);
      db._create(vC4);
      var vertex1 = db[vC1].save({});
      vertexId1 = vertex1._id;
      var vertex2 = db[vC1].save({});
      vertexId2 = vertex2._id;
      var vertex3 = db[vC1].save({});
      var vertexId3 = vertex3._id;
      var vertex4 = db[vC1].save({});
      var vertexId4 = vertex4._id;
      var edge1 = db[eC1].save(eC4 + "/4", vertexId1, {_key: "1"});
      var edge2 = db[eC2].save(eC1 + "/1", vertexId2, {_key: "2"});
      var edge3 = db[eC3].save(eC2 + "/2", vertexId3, {_key: "3"});
      var edge4 = db[eC4].save(eC3 + "/3", vertexId4, {_key: "4"});

      var g1 = graph._create(
        gN1,
        graph._edgeDefinitions(
          graph._relation(eC1, [eC4], [vC1])
        )
      );
      graph._create(
        gN2,
        graph._edgeDefinitions(
          graph._relation(eC2, [eC1], [vC2])
        )
      );
      graph._create(
        gN3,
        graph._edgeDefinitions(
          graph._relation(eC3, [eC2], [vC3])
        )
      );
      graph._create(
        gN4,
        graph._edgeDefinitions(
          graph._relation(eC4, [eC3], [vC4])
        )
      );

      assertTrue(db._exists(edge1._id));
      assertTrue(db._exists(edge2._id));
      assertTrue(db._exists(edge3._id));
      assertTrue(db._exists(edge4._id));
      assertTrue(db._exists(vertexId1));
      assertTrue(db._exists(vertexId2));
      assertTrue(db._exists(vertexId3));
      assertTrue(db._exists(vertexId4));

      g1[eC1].remove(edge1._id);

      assertFalse(db._exists(edge1._id));
      assertFalse(db._exists(edge2._id));
      assertFalse(db._exists(edge3._id));
      assertFalse(db._exists(edge4._id));
      assertTrue(db._exists(vertexId1));
      assertTrue(db._exists(vertexId2));
      assertTrue(db._exists(vertexId3));
      assertTrue(db._exists(vertexId4));

      graph._drop(gN1, true);
      graph._drop(gN2, true);
      graph._drop(gN3, true);
      graph._drop(gN4, true);
    },

    test_eC_malformedId: function () {
      [null, "foo", []].forEach(function (v) {
        try {
          g[ec2].save(v, v, {});
          fail();
        } catch (e) {
          assertEqual(
            e.errorMessage,
            arangodb.errors.ERROR_ARANGO_DOCUMENT_HANDLE_BAD.message
          );
        }
      });
    },

    test_getInVertex: function () {
      var ids = fillCollections();
      var result = g._fromVertex(ids.eId11);
      assertEqual(result._id, ids.vId11);
    },

    test_getOutVertex: function () {
      var ids = fillCollections();
      var result = g._toVertex(ids.eId11);
      assertEqual(result._id, ids.vId12);
      result = g._toVertex(ids.eId25);
      assertEqual(result._id, ids.vId35);
    },

    test_getFromVertexInvalidHandle: function () {
      try {
        g._fromVertex("foobar");
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_ARANGO_DOCUMENT_HANDLE_BAD.code);
      }
    },

    test_getFromVertexInvalidCollectionType: function () {
      try {
        g._fromVertex(vc1 + "/foobar");
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_GRAPH_EDGE_COL_DOES_NOT_EXIST.code);
      }
    },

    test_getFromVertexNonexistingCollection: function () {
      try {
        g._fromVertex("UnitTestsCollectionDoesNotExist/foobar");
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_GRAPH_EDGE_COL_DOES_NOT_EXIST.code);
      }
    }

  };
}

function GeneralGraphCommonNeighborsSuite() {
  'use strict';
  var testGraph, actual;

  var v1ColName = "UnitTestsAhuacatlVertex1";
  var v2ColName = "UnitTestsAhuacatlVertex2";
  var eColName = "UnitTestsAhuacatlEdge1";
  var v1;
  var v2;
  var v3;
  var v4;
  var v5;
  var v6;
  var v7;
  var v8;

  var createKeyValueObject = function (key, value) {
    var res = {};
    res[key] = value;
    return res;
  };

  return {

////////////////////////////////////////////////////////////////////////////////
/// @brief set up
////////////////////////////////////////////////////////////////////////////////

    setUp: function () {
      db._drop(v1ColName);
      db._drop(v2ColName);
      db._drop(eColName);

      var vertex1 = db._create(v1ColName);
      var vertex2 = db._create(v2ColName);
      var edge1 = db._createEdgeCollection(eColName);

      v1 = vertex1.save({_key: "v1", hugo: true})._id;
      v2 = vertex1.save({_key: "v2", hugo: true})._id;
      v3 = vertex1.save({_key: "v3", heinz: 1})._id;
      v4 = vertex1.save({_key: "v4", harald: "meier"})._id;
      v5 = vertex2.save({_key: "v5", ageing: true})._id;
      v6 = vertex2.save({_key: "v6", harald: "meier", ageing: true})._id;
      v7 = vertex2.save({_key: "v7", harald: "meier"})._id;
      v8 = vertex2.save({_key: "v8", heinz: 1, harald: "meier"})._id;

      function makeEdge(from, to, collection) {
        collection.save(from, to, {what: from.split("/")[1] + "->" + to.split("/")[1]});
      }

      makeEdge(v1, v2, edge1);
      makeEdge(v2, v3, edge1);
      makeEdge(v3, v5, edge1);
      makeEdge(v2, v6, edge1);
      makeEdge(v6, v7, edge1);
      makeEdge(v4, v7, edge1);
      makeEdge(v3, v7, edge1);
      makeEdge(v8, v1, edge1);
      makeEdge(v3, v5, edge1);
      makeEdge(v3, v8, edge1);

      try {
        db._collection("_graphs").remove("_graphs/bla3");
      } catch (ignore) {
      }
      testGraph = graph._create(
        "bla3",
        graph._edgeDefinitions(
          graph._relation(eColName,
            [v1ColName, v2ColName],
            [v1ColName, v2ColName]
          )
        )
      );
    },

////////////////////////////////////////////////////////////////////////////////
/// @brief tear down
////////////////////////////////////////////////////////////////////////////////

    tearDown: function () {
      db._drop(v1ColName);
      db._drop(v2ColName);
      db._drop(eColName);
      try {
        db._collection("_graphs").remove("_graphs/bla3");
      } catch (ignore) {
      }
    },

////////////////////////////////////////////////////////////////////////////////
/// @brief checks GRAPH_COMMON_NEIGHBORS() and GRAPH_COMMON_PROPERTIES()
////////////////////////////////////////////////////////////////////////////////


    testNeighborsAnyV3: function () {
      actual = testGraph._neighbors(v3, {includeData: true}).sort();
      assertTrue(actual[0]._id, v2);
      assertTrue(actual[1]._id, v5);
      assertTrue(actual[2]._id, v7);
      assertTrue(actual[3]._id, v8);
    },

    testNeighborsAnyV6: function () {
      actual = testGraph._neighbors(v6, {includeData: true}).sort();
      assertTrue(actual[0]._id, v2);
      assertTrue(actual[1]._id, v7);
    },


    testCommonNeighborsAny: function () {
      actual = testGraph._commonNeighbors(v3, v6);
      assertEqual(actual.length, 1);
      assertEqual(actual[0].left, v3);
      assertEqual(actual[0].right, v6);
      assertEqual(actual[0].neighbors.length, 2);
      actual[0].neighbors.sort();
      assertEqual(actual[0].neighbors[0], v2);
      assertEqual(actual[0].neighbors[1], v7);
      actual = testGraph._countCommonNeighbors(v3, v6);
      assertEqual(actual[0][v3][0][v6], 2);
    },
////////////////////////////////////////////////////////////////////////////////
/// @brief checks GRAPH_COMMON_NEIGHBORS()
////////////////////////////////////////////////////////////////////////////////

    testCommonNeighborsIn: function () {
      actual = testGraph._commonNeighbors({}, {}, {direction: 'inbound'}, {direction: 'inbound'});
      assertEqual(actual.length, 8);

      actual = testGraph._countCommonNeighbors({}, {}, {direction: 'inbound'}, {direction: 'inbound'});
      assertEqual(actual.length, 5);

    },


////////////////////////////////////////////////////////////////////////////////
/// @brief checks GRAPH_COMMON_NEIGHBORS()
////////////////////////////////////////////////////////////////////////////////

    testCommonNeighborsOut: function () {
      actual = testGraph._commonNeighbors(
        {hugo: true}, {heinz: 1},
        {direction: 'outbound', minDepth: 1, maxDepth: 3},
        {direction: 'outbound', minDepth: 1, maxDepth: 3}
      );

      actual.sort(function (a, b) {
        if (a.left < b.left) {
          return -1;
        }
        if (b.left < a.left) {
          return 1;
        }
        if (a.right < b.right) {
          return -1;
        }
        if (b.right < a.right) {
          return 1;
        }
        return 0;
      });
      assertEqual(actual.length, 4);
      assertEqual(actual[0].left, v1);
      assertEqual(actual[0].right, v3);
      assertEqual(actual[0].neighbors.length, 4);

      assertEqual(actual[1].left, v1);
      assertEqual(actual[1].right, v8);
      assertEqual(actual[1].neighbors.length, 3);

      assertEqual(actual[2].left, v2);
      assertEqual(actual[2].right, v3);
      assertEqual(actual[2].neighbors.length, 4);

      assertEqual(actual[3].left, v2);
      assertEqual(actual[3].right, v8);
      assertEqual(actual[3].neighbors.length, 3);

      actual = testGraph._countCommonNeighbors(
        {hugo: true}, {heinz: 1},
        {direction: 'outbound', minDepth: 1, maxDepth: 3},
        {direction: 'outbound', minDepth: 1, maxDepth: 3}
      );
      if (actual[0].hasOwnProperty(v1)) {
        if (actual[0][v1][0].hasOwnProperty(v8)) {
          assertEqual(actual[0][v1][0][v8], 3);
          assertEqual(actual[0][v1][1][v3], 4);
        } else {
          assertEqual(actual[0][v1][0][v3], 4);
          assertEqual(actual[0][v1][1][v8], 3);
        }

        if (actual[1][v2][0].hasOwnProperty(v8)) {
          assertEqual(actual[1][v2][0][v8], 3);
          assertEqual(actual[1][v2][1][v3], 4);
        } else {
          assertEqual(actual[1][v2][0][v3], 4);
          assertEqual(actual[1][v2][1][v8], 3);
        }
      } else {
        if (actual[0][v2][0].hasOwnProperty(v8)) {
          assertEqual(actual[0][v2][0][v8], 3);
          assertEqual(actual[0][v2][1][v3], 4);
        } else {
          assertEqual(actual[0][v2][0][v3], 4);
          assertEqual(actual[0][v2][1][v8], 3);
        }

        if (actual[1][v1][0].hasOwnProperty(v8)) {
          assertEqual(actual[1][v1][0][v8], 3);
          assertEqual(actual[1][v1][1][v3], 4);
        } else {
          assertEqual(actual[1][v1][0][v3], 4);
          assertEqual(actual[1][v1][1][v8], 3);
        }
      }
    },

////////////////////////////////////////////////////////////////////////////////
/// @brief checks GRAPH_COMMON_PROPERTIES()
////////////////////////////////////////////////////////////////////////////////

    testCommonProperties: function () {
      actual = testGraph._commonProperties({}, {}, {});
      assertEqual(actual.length, 8);

      actual = testGraph._countCommonProperties({}, {}, {});
      assertEqual(actual, [
        createKeyValueObject(v1, 1),
        createKeyValueObject(v2, 1),
        createKeyValueObject(v3, 1),
        createKeyValueObject(v4, 3),
        createKeyValueObject(v5, 1),
        createKeyValueObject(v6, 4),
        createKeyValueObject(v7, 3),
        createKeyValueObject(v8, 4)
      ]);
    },

    testCommonPropertiesWithFilters: function () {
      actual = testGraph._commonProperties({ageing: true}, {harald: 'meier'}, {});
      assertEqual(actual[0][v5][0]._id, v6);
      var proV6 = actual[1][v6];
      proV6.sort(function (a, b) {
        return a._id > b._id;
      });
      assertEqual(proV6[0]._id, v4);
      assertEqual(proV6[1]._id, v7);
      assertEqual(proV6[2]._id, v8);

      actual = testGraph._countCommonProperties({ageing: true}, {harald: 'meier'}, {});
      assertEqual(actual, [
        createKeyValueObject(v5, 1),
        createKeyValueObject(v6, 3)
      ]);

    },

    testCommonPropertiesWithFiltersAndIgnoringKeyHarald: function () {
      actual = testGraph._commonProperties({}, {}, {ignoreProperties: 'harald'});

      assertEqual(actual[0][v1][0]._id, v2);
      assertEqual(actual[1][v2][0]._id, v1);
      assertEqual(actual[2][v3][0]._id, v8);
      assertEqual(actual[3][v5][0]._id, v6);
      assertEqual(actual[4][v6][0]._id, v5);
      assertEqual(actual[5][v8][0]._id, v3);

      actual = testGraph._countCommonProperties({}, {}, {ignoreProperties: 'harald'});
      assertEqual(actual, [
        createKeyValueObject(v1, 1),
        createKeyValueObject(v2, 1),
        createKeyValueObject(v3, 1),
        createKeyValueObject(v5, 1),
        createKeyValueObject(v6, 1),
        createKeyValueObject(v8, 1)
      ]);
    }
  };
}

function OrphanCollectionSuite() {
  'use strict';
  var prefix = "UnitTestGraphVertexCollection",
    g1,
    g2,
    gN1 = prefix + "Graph1",
    gN2 = prefix + "Graph2",
    eC1 = prefix + "EdgeCollection1",
    eC2 = prefix + "EdgeCollection2",
    vC1 = prefix + "VertexCollection1",
    vC2 = prefix + "VertexCollection2",
    vC3 = prefix + "VertexCollection3",
    vC4 = prefix + "VertexCollection4",
    vC5 = prefix + "VertexCollection5";

  return {

    setUp: function () {
      try {
        arangodb.db._collection("_graphs").remove(gN1);
      } catch (ignore) {
      }
      try {
        arangodb.db._collection("_graphs").remove(gN2);
      } catch (ignore) {
      }
      g1 = graph._create(
        gN1,
        graph._edgeDefinitions(
          graph._relation(
            eC1, [vC1], [vC1, vC2]
          )
        )
      );
      g2 = graph._create(
        gN2,
        graph._edgeDefinitions(
          graph._relation(
            eC2, [vC3], [vC1]
          )
        )
      );
    },

    tearDown: function () {
      try {
        graph._drop(gN1, true);
      } catch (ignore) {
      }
      try {
        graph._drop(gN2, true);
      } catch (ignore) {
      }
      try {
        db[vC1].drop();
      } catch (ignore) {
      }
      try {
        db[vC4].drop();
      } catch (ignore) {
      }
    },

    test_getOrphanCollection: function () {
      assertEqual(g1._orphanCollections(), []);
    },

    test_addVertexCollection1: function () {
      g1._addVertexCollection(vC5, true);
      assertEqual(g1._orphanCollections(), [vC5]);
    },

    test_addVertexCollection2: function () {
      try {
        g1._addVertexCollection(vC4, false);
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_GRAPH_VERTEX_COL_DOES_NOT_EXIST.code);
        assertEqual(e.errorMessage, vC4 + " " + ERRORS.ERROR_GRAPH_VERTEX_COL_DOES_NOT_EXIST.message);
      }
      assertTrue(db._collection(vC4) === null);
      g1 = graph._graph(gN1);
      assertEqual(g1._orphanCollections(), []);
    },

    test_addVertexCollection3: function () {
      try {
        g1._addVertexCollection(eC1, false);
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_GRAPH_WRONG_COLLECTION_TYPE_VERTEX.code);
        assertEqual(e.errorMessage, ERRORS.ERROR_GRAPH_WRONG_COLLECTION_TYPE_VERTEX.message);
      }
      assertTrue(db._collection(vC4) === null);
      assertEqual(g1._orphanCollections(), []);
    },

    test_addVertexCollection4: function () {
      try {
        g1._addVertexCollection(vC1);
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_GRAPH_COLLECTION_USED_IN_EDGE_DEF.code);
        assertEqual(e.errorMessage, vC1 + " " + ERRORS.ERROR_GRAPH_COLLECTION_USED_IN_EDGE_DEF.message);
      }
    },

    test_removeVertexCollection1: function () {
      var name = "completelyNonsenseNameForACollectionBLUBBBBB";
      try {
        g1._removeVertexCollection(name);
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_GRAPH_NOT_IN_ORPHAN_COLLECTION.code);
        assertEqual(e.errorMessage, ERRORS.ERROR_GRAPH_NOT_IN_ORPHAN_COLLECTION.message);
      }
    },

    test_removeVertexCollection2: function () {
      g1._addVertexCollection(vC4, true);
      g1._addVertexCollection(vC5, true);
      assertEqual(g1._orphanCollections().sort(), [vC4, vC5].sort());
      g1._removeVertexCollection(vC4, false);
      assertTrue(db._collection(vC4) !== null);
      g1 = graph._graph(gN1);
      assertEqual(g1._orphanCollections().sort(), [vC5].sort());
      try {
        g1._removeVertexCollection(vC4, true);
      } catch (e) {
        assertEqual(e.errorNum, ERRORS.ERROR_GRAPH_NOT_IN_ORPHAN_COLLECTION.code);
        assertEqual(e.errorMessage, ERRORS.ERROR_GRAPH_NOT_IN_ORPHAN_COLLECTION.message);
      }
    },

    test_doNotDropOrphanCollectionsUsedInOtherEdgedefinitions: function () {
      assertTrue(db._collection(vC3) !== null);
      g1._addVertexCollection(vC3, true);
      assertTrue(db._collection(vC3) !== null);
      graph._drop(gN1, true);
      assertTrue(db._collection(vC3) !== null);
      graph._drop(gN2, true);
      db._flushCache();
      assertTrue(db._collection(vC3) === null);
    },

    test_doNotDropCollectionsIfUsedAsOrphansInOtherGraphs: function () {
      assertTrue(db._collection(vC3) !== null);
      g1._addVertexCollection(vC3, true);
      assertTrue(db._collection(vC3) !== null);
      graph._drop(gN2, true);
      assertTrue(db._collection(vC3) !== null);
      graph._drop(gN1, true);
      db._flushCache();
      assertTrue(db._collection(vC3) === null);
    },

    test_doNotDropOrphanCollectionsUsedAsOrphansInOtherGraphs: function () {
      assertTrue(db._collection(vC4) === null);
      g1._addVertexCollection(vC4, true);
      g2._addVertexCollection(vC4, true);
      assertTrue(db._collection(vC4) !== null);
      graph._drop(gN1, true);
      assertTrue(db._collection(vC4) !== null);
      graph._drop(gN2, true);
      db._flushCache();
      assertTrue(db._collection(vC4) === null);
    },

    test_doNotAddTheSameOrphanCollectionMultipleTimes: function () {
      g1._addVertexCollection(vC4, true);
      try {
        g1._addVertexCollection(vC4, true);
        fail();
      } catch (err) {
        assertEqual(err.errorNum, arangodb.errors.ERROR_GRAPH_COLLECTION_USED_IN_ORPHANS.code);
        assertEqual(err.errorMessage,
          arangodb.errors.ERROR_GRAPH_COLLECTION_USED_IN_ORPHANS.message);
      }
    }
  };
}

function MeasurementsSuite() {
  'use strict';
  var g;
  var unitTestGraphName = "unitTestGraph";

  var ec1 = "unitTestEdgeCollection1";
  var ec2 = "unitTestEdgeCollection2";
  var ec3 = "unitTestEdgeCollection3";
  var vc1 = "unitTestVertexCollection1";
  var vc2 = "unitTestVertexCollection2";


  var fillCollections = function () {
    var ids = {};
    var vertex = g[vc1].save({first_name: "Tam"});
    ids.vId11 = vertex._id;
    vertex = g[vc1].save({first_name: "Tem", age: 20});
    ids.vId12 = vertex._id;
    vertex = g[vc1].save({first_name: "Tim"});
    ids.vId13 = vertex._id;
    vertex = g[vc1].save({first_name: "Tom"});
    ids.vId14 = vertex._id;
    vertex = g[vc1].save({first_name: "Tum"});
    ids.vId15 = vertex._id;
    vertex = g[vc2].save({first_name: "Tam"});
    ids.vId31 = vertex._id;
    vertex = g[vc2].save({first_name: "Tem"});
    ids.vId32 = vertex._id;
    vertex = g[vc2].save({first_name: "Tim", age: 24});
    ids.vId33 = vertex._id;
    vertex = g[vc2].save({first_name: "Tom"});
    ids.vId34 = vertex._id;
    vertex = g[vc2].save({first_name: "Tum"});
    ids.vId35 = vertex._id;

    ids.eId11 = g[ec1].save(ids.vId11, ids.vId12, {});
    ids.eId12 = g[ec1].save(ids.vId12, ids.vId13, {});
    ids.eId13 = g[ec1].save(ids.vId13, ids.vId14, {});
    ids.eId14 = g[ec1].save(ids.vId14, ids.vId15, {});

    ids.eId21 = g[ec2].save(ids.vId11, ids.vId32, {});
    ids.eId22 = g[ec2].save(ids.vId11, ids.vId31, {});
    ids.eId23 = g[ec2].save(ids.vId14, ids.vId33, {});

    ids.eId31 = g[ec3].save(ids.vId31, ids.vId33, {});
    ids.eId32 = g[ec3].save(ids.vId31, ids.vId34, {});
    ids.eId33 = g[ec3].save(ids.vId33, ids.vId34, {});

    return ids;
  };

  var allIds;

  return {

    setUp: function () {
      g = graph._create(
        unitTestGraphName,
        graph._edgeDefinitions(
          graph._relation(ec1, vc1, vc1),
          graph._relation(ec2, vc1, vc2),
          graph._relation(ec3, vc2, vc2)
        )
      );
      allIds = fillCollections();
    },

    tearDown: function () {
      try {
        graph._drop(unitTestGraphName, true);
      } catch (e) {

      }
    },

    test_radius: function () {
      var a = g._radius({});
      assertEqual(a, 3);
    },
    test_diameter: function () {
      var a = g._diameter({});
      assertEqual(a, 5);
    },

    test_shortestPaths: function () {
      var a = g._shortestPath([
        {first_name: 'Tim', age: 24},
        {first_name: 'Tom'}
      ], [
        {first_name: 'Tam'},
        {first_name: 'Tem', age: 20}
      ]);
      assertEqual(a.length, 9);
    },

    test_distanceTo: function () {
      var a = g._distanceTo([
        {first_name: 'Tim', age: 24},
        {first_name: 'Tom'}
      ], [
        {first_name: 'Tam'},
        {first_name: 'Tem', age: 20}
      ]);
      assertEqual(a.length, 9);
    }
  };
}

function MeasurementsMovedFromAQLSuite() {
  'use strict';

  const v1 = "UnitTests_Berliner";
  const v2 = "UnitTests_Hamburger";
  const v3 = "UnitTests_Frankfurter";
  const v4 = "UnitTests_Leipziger";
  var vertexIds = {};
  const graphName = "werKenntWen";
  var g;

  var validateNumericValues = function (actual, expected) {
    assertEqual(Object.keys(actual).sort(), Object.keys(expected).sort());
    for (let k of Object.keys(expected)) {
      assertEqual(actual[k].toFixed(4), expected[k].toFixed(4));
    }
  };

  return {

    ////////////////////////////////////////////////////////////////////////////////
    /// @brief set up
    ////////////////////////////////////////////////////////////////////////////////

    setUp: function () {
      db._drop(v1);
      db._drop(v2);
      db._drop(v3);
      db._drop(v4);
      db._drop("UnitTests_KenntAnderenBerliner");
      db._drop("UnitTests_KenntAnderen");

      var KenntAnderenBerliner = "UnitTests_KenntAnderenBerliner";
      var KenntAnderen = "UnitTests_KenntAnderen";

      var Berlin = db._create(v1);
      var Hamburg = db._create(v2);
      var Frankfurt = db._create(v3);
      var Leipzig = db._create(v4);
      db._createEdgeCollection(KenntAnderenBerliner);
      db._createEdgeCollection(KenntAnderen);

      var Anton = Berlin.save({_key: "Anton", gender: "male", age: 20});
      var Berta = Berlin.save({_key: "Berta", gender: "female", age: 25});
      var Caesar = Hamburg.save({_key: "Caesar", gender: "male", age: 30});
      var Dieter = Hamburg.save({_key: "Dieter", gender: "male", age: 20});
      var Emil = Frankfurt.save({_key: "Emil", gender: "male", age: 25});
      var Fritz = Frankfurt.save({_key: "Fritz", gender: "male", age: 30});
      var Gerda = Leipzig.save({_key: "Gerda", gender: "female", age: 40});

      vertexIds.Anton = Anton._id;
      vertexIds.Berta = Berta._id;
      vertexIds.Caesar = Caesar._id;
      vertexIds.Dieter = Dieter._id;
      vertexIds.Emil = Emil._id;
      vertexIds.Fritz = Fritz._id;
      vertexIds.Gerda = Gerda._id;

      try {
        db._collection("_graphs").remove(graphName);
      } catch (ignore) {
      }
      g = graph._create(
        graphName,
        graph._edgeDefinitions(
          graph._relation(KenntAnderenBerliner, v1, v1),
          graph._relation(KenntAnderen,
            [v1, v2, v3, v4],
            [v1, v2, v3, v4]
          )
        )
      );

      function makeEdge(from, to, collection, distance) {
        collection.save(from, to, {what: from.split("/")[1] + "->" + to.split("/")[1], entfernung: distance});
      }

      makeEdge(Berta._id, Anton._id, g[KenntAnderenBerliner], 0.1);
      makeEdge(Caesar._id, Anton._id, g[KenntAnderen], 350);
      makeEdge(Caesar._id, Berta._id, g[KenntAnderen], 250.1);
      makeEdge(Berta._id, Gerda._id, g[KenntAnderen], 200);
      makeEdge(Gerda._id, Dieter._id, g[KenntAnderen], "blub");
      makeEdge(Dieter._id, Emil._id, g[KenntAnderen], 300);
      makeEdge(Emil._id, Fritz._id, g[KenntAnderen], 0.2);
    },

    ////////////////////////////////////////////////////////////////////////////////
    /// @brief tear down
    ////////////////////////////////////////////////////////////////////////////////

    tearDown: function () {
      graph._drop("werKenntWen", true);
    },

    // Test Radius
    testRadiusDefault: function () {
      var actual = g._radius();
      assertEqual(actual, 3);
    },

    testRadiusWeight: function () {
      var actual = g._radius({weightAttribute: "entfernung", defaultWeight: 80});
      assertEqual(actual.toFixed(1), 450.1);
    },

    testRadiusInbound: function () {
      var actual = g._radius({direction: "inbound"});
      assertEqual(actual, 1);
    },

    testRadiusInboundWeight: function () {
      var actual = g._radius({direction: "inbound", weightAttribute: "entfernung", defaultWeight: 80});
      assertEqual(actual.toFixed(1), 250.1);
    },

    testRadiusOutbound: function () {
      var actual = g._radius({direction: "outbound"});
      assertEqual(actual, 1);
    },

    testRadiusOutboundWeight: function () {
      var actual = g._radius({direction: "outbound", weightAttribute: "entfernung", defaultWeight: 80});
      assertEqual(actual.toFixed(1), 0.2);
    },


    // Test Diameter

    testDiameterDefault: function () {
      var actual = g._diameter();
      assertEqual(actual, 5);
    },

    testDiameterWeight: function () {
      var actual = g._diameter({weightAttribute: "entfernung", defaultWeight: 80});
      assertEqual(actual.toFixed(1), 830.3);
    },

    testDiameterInbound: function () {
      var actual = g._diameter({direction: "inbound"});
      assertEqual(actual, 5);
    },

    testDiameterInboundWeight: function () {
      var actual = g._diameter({direction: "inbound", weightAttribute: "entfernung", defaultWeight: 80});
      assertEqual(actual.toFixed(1), 830.3);
    },

    testDiameterOutbound: function () {
      var actual = g._diameter({direction: "outbound"});
      assertEqual(actual, 5);
    },

    testDiameterOutboundWeight: function () {
      var actual = g._diameter({direction: "outbound", weightAttribute: "entfernung", defaultWeight: 80});
      assertEqual(actual.toFixed(1), 830.3);
    },

    testAbsoluteEccentricityDefault: function () {
      var actual = g._absoluteEccentricity(vertexIds.Anton);
      var expected = {};
      expected[vertexIds.Anton] = 5;
      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityWeight: function () {
      var actual = g._absoluteEccentricity(vertexIds.Anton, {weightAttribute: "entfernung", defaultWeight: 80});
      var expected = {};
      expected[vertexIds.Anton] = 580.3;
      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityInbound: function () {
      var actual = g._absoluteEccentricity(vertexIds.Anton, {direction: "inbound"});
      var expected = {};
      expected[vertexIds.Anton] = 1;
      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityInboundWeight: function () {
      var actual = g._absoluteEccentricity(vertexIds.Anton, {
        direction: "inbound",
        weightAttribute: "entfernung",
        defaultWeight: 80
      });
      var expected = {};
      expected[vertexIds.Anton] = 250.2;
      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityOutbound: function () {
      var actual = g._absoluteEccentricity(vertexIds.Gerda, {direction: "outbound"});
      var expected = {};
      expected[vertexIds.Gerda] = 3;
      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityOutboundWeight: function () {
      var actual = g._absoluteEccentricity(vertexIds.Gerda, {
        direction: "outbound",
        weightAttribute: "entfernung",
        defaultWeight: 80
      });
      var expected = {};
      expected[vertexIds.Gerda] = 380.2;

      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityExample: function () {
      var actual = g._absoluteEccentricity({gender: "female"}, {direction: "outbound"});
      var expected = {};
      expected[vertexIds.Berta] = 4;
      expected[vertexIds.Gerda] = 3;

      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityExampleWeight: function () {
      var actual = g._absoluteEccentricity({gender: "female"}, {
        direction: "outbound",
        weightAttribute: "entfernung",
        defaultWeight: 80
      });
      var expected = {};
      expected[vertexIds.Berta] = 580.2;
      expected[vertexIds.Gerda] = 380.2;

      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityAll: function () {
      var actual = g._absoluteEccentricity({}, {direction: "outbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 4;
      expected[vertexIds.Caesar] = 5;
      expected[vertexIds.Dieter] = 2;
      expected[vertexIds.Emil] = 1;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 3;

      validateNumericValues(actual, expected);
    },

    testAbsoluteEccentricityAllWeight: function () {
      var actual = g._absoluteEccentricity({}, {
        direction: "outbound",
        weightAttribute: "entfernung",
        defaultWeight: 80
      });
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 580.2;
      expected[vertexIds.Caesar] = 830.3;
      expected[vertexIds.Dieter] = 300.2;
      expected[vertexIds.Emil] = 0.2;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 380.2;

      validateNumericValues(actual, expected);
    },

    testEccentricityOutbound: function () {
      var actual = g._eccentricity({direction: "outbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 1 / 4;
      expected[vertexIds.Caesar] = 1 / 5;
      expected[vertexIds.Dieter] = 1 / 2;
      expected[vertexIds.Emil] = 1 / 1;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 1 / 3;

      validateNumericValues(actual, expected);
    },

    testEccentricityOutboundWeight: function () {
      var actual = g._eccentricity({direction: "outbound", weightAttribute: "entfernung", defaultWeight: 80});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 0.2 / 580.2;
      expected[vertexIds.Caesar] = 0.2 / 830.3;
      expected[vertexIds.Dieter] = 0.2 / 300.2;
      expected[vertexIds.Emil] = 0.2 / 0.2;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 0.2 / 380.2;

      validateNumericValues(actual, expected);
    },

    testFarness: function () {
      var actual = g._farness(vertexIds.Anton);
      var expected = {};
      expected[vertexIds.Anton] = 16;
      validateNumericValues(actual, expected);
    },

    testFarnessOutbound: function () {
      var actual = g._farness(vertexIds.Anton, {direction: "outbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      validateNumericValues(actual, expected);
    },

    testFarnessExampleWeight: function () {
      var actual = g._farness({gender: "male"}, {weightAttribute: "entfernung", defaultWeight: 80});
      var expected = {};
      expected[vertexIds.Anton] = 1890.9;
      expected[vertexIds.Caesar] = 3140.9;
      expected[vertexIds.Dieter] = 1770.4;
      expected[vertexIds.Emil] = 2670.4;
      expected[vertexIds.Fritz] = 2671.4;
      validateNumericValues(actual, expected);

      // Legacy
      actual = g._absoluteCloseness({gender: "male"}, {weightAttribute: "entfernung", defaultWeight: 80});
      validateNumericValues(actual, expected);
    },

    testFarnessAll: function () {
      var actual = g._farness({});
      var expected = {};
      expected[vertexIds.Anton] = 16;
      expected[vertexIds.Berta] = 12;
      expected[vertexIds.Caesar] = 16;
      expected[vertexIds.Dieter] = 12;
      expected[vertexIds.Emil] = 15;
      expected[vertexIds.Fritz] = 20;
      expected[vertexIds.Gerda] = 11;
      validateNumericValues(actual, expected);
    },

    testFarnessAllOutbound: function () {
      var actual = g._farness({}, {direction: "outbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 11;
      expected[vertexIds.Caesar] = 16;
      expected[vertexIds.Dieter] = 3;
      expected[vertexIds.Emil] = 1;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 6;
      validateNumericValues(actual, expected);
    },

    testClosenessDefault: function () {
      var actual = g._closeness();
      var expected = {};
      expected[vertexIds.Anton] = 11 / 16;
      expected[vertexIds.Berta] = 11 / 12;
      expected[vertexIds.Caesar] = 11 / 16;
      expected[vertexIds.Dieter] = 11 / 12;
      expected[vertexIds.Emil] = 11 / 15;
      expected[vertexIds.Fritz] = 11 / 20;
      expected[vertexIds.Gerda] = 11 / 11;
      validateNumericValues(actual, expected);
    },

    testClosenessOutbound: function () {
      var actual = g._closeness({direction: "outbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 1 / 11;
      expected[vertexIds.Caesar] = 1 / 16;
      expected[vertexIds.Dieter] = 1 / 3;
      expected[vertexIds.Emil] = 1 / 1;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 1 / 6;
      validateNumericValues(actual, expected);
    },

    testAbsoluteBetweeness: function () {
      var actual = g._absoluteBetweenness(vertexIds.Anton);
      var expected = {};
      expected[vertexIds.Anton] = 0;
      validateNumericValues(actual, expected);
    },

    testAbsoluteBetweenessAll: function () {
      var actual = g._absoluteBetweenness({});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 8;
      expected[vertexIds.Caesar] = 0;
      expected[vertexIds.Dieter] = 8;
      expected[vertexIds.Emil] = 5;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 9;
      validateNumericValues(actual, expected);
    },

    testAbsoluteBetweenessExample: function () {
      var actual = g._absoluteBetweenness({gender: "female"});
      var expected = {};
      expected[vertexIds.Berta] = 8;
      expected[vertexIds.Gerda] = 9;
      validateNumericValues(actual, expected);
    },

    testAbsoluteBetweenessAllOutbound: function () {
      var actual = g._absoluteBetweenness({}, {direction: "outbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 4;
      expected[vertexIds.Caesar] = 0;
      expected[vertexIds.Dieter] = 6;
      expected[vertexIds.Emil] = 4;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 6;
      validateNumericValues(actual, expected);
    },

    testAbsoluteBetweenessAllInbound: function () {
      var actual = g._absoluteBetweenness({}, {direction: "inbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 4;
      expected[vertexIds.Caesar] = 0;
      expected[vertexIds.Dieter] = 6;
      expected[vertexIds.Emil] = 4;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 6;
      validateNumericValues(actual, expected);
    },

    testBetweenessAny: function () {
      var actual = g._betweenness();
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 8 / 9;
      expected[vertexIds.Caesar] = 0;
      expected[vertexIds.Dieter] = 8 / 9;
      expected[vertexIds.Emil] = 5 / 9;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 9 / 9;
      validateNumericValues(actual, expected);
    },

    testBetweenessOutbound: function () {
      var actual = g._betweenness({direction: "outbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 4 / 6;
      expected[vertexIds.Caesar] = 0;
      expected[vertexIds.Dieter] = 6 / 6;
      expected[vertexIds.Emil] = 4 / 6;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 6 / 6;
      validateNumericValues(actual, expected);
    },

    testBetweenessInbound: function () {
      var actual = g._betweenness({direction: "inbound"});
      var expected = {};
      expected[vertexIds.Anton] = 0;
      expected[vertexIds.Berta] = 4 / 6;
      expected[vertexIds.Caesar] = 0;
      expected[vertexIds.Dieter] = 6 / 6;
      expected[vertexIds.Emil] = 4 / 6;
      expected[vertexIds.Fritz] = 0;
      expected[vertexIds.Gerda] = 6 / 6;
      validateNumericValues(actual, expected);
    }

  };
}

////////////////////////////////////////////////////////////////////////////////
/// @brief executes the test suites
////////////////////////////////////////////////////////////////////////////////

jsunity.run(GeneralGraphCommonNeighborsSuite);
jsunity.run(EdgesAndVerticesSuite);
jsunity.run(GeneralGraphCreationSuite);
jsunity.run(OrphanCollectionSuite);
jsunity.run(MeasurementsSuite);
jsunity.run(MeasurementsMovedFromAQLSuite);

return jsunity.done();