/* -*- mode: C++; indent-tabs-mode: nil; -*-

 /* -*- mode: C++; indent-tabs-mode: nil; -*-

  *

  *

  * This file is a part of LEMON, a generic C++ optimization library.

  * This file is a part of LEMON, a generic C++ optimization library.

  *

  *

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  *

  * Permission to use, modify and distribute this software is granted

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * provided that this copyright notice appears in all copies. For

   snapshot.save(G);

   snapshot.save(G);

   checkGraphNodeList(G, 4);

   checkGraphNodeList(G, 4);

   checkGraphEdgeList(G, 3);

   checkGraphEdgeList(G, 3);

   checkGraphArcList(G, 6);

   checkGraphArcList(G, 6);

   G.addEdge(G.addNode(), G.addNode());

   G.addEdge(G.addNode(), G.addNode());

   snapshot.restore();

   snapshot.restore();

   checkGraphNodeList(G, 4);

   checkGraphNodeList(G, 4);

   HypercubeGraph G(dim);

   HypercubeGraph G(dim);

   check(G.dimension() == dim, "Wrong dimension");

   check(G.dimension() == dim, "Wrong dimension");

   G.resize(dim);

   G.resize(dim);

   check(G.dimension() == dim, "Wrong dimension");

   check(G.dimension() == dim, "Wrong dimension");

   checkGraphNodeList(G, 1 << dim);

   checkGraphNodeList(G, 1 << dim);

   checkGraphEdgeList(G, dim * (1 << (dim-1)));

   checkGraphEdgeList(G, dim * (1 << (dim-1)));

   checkGraphArcList(G, dim * (1 << dim));

   checkGraphArcList(G, dim * (1 << dim));

   Node n = G.nodeFromId(dim);

   Node n = G.nodeFromId(dim);