/* -*- 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

   digraphCopy(from, to).

   digraphCopy(from, to).

     nodeMap(fnm, tnm).arcMap(fam, tam).

     nodeMap(fnm, tnm).arcMap(fam, tam).

     nodeRef(nr).arcRef(er).

     nodeRef(nr).arcRef(er).

     nodeCrossRef(ncr).arcCrossRef(ecr).

     nodeCrossRef(ncr).arcCrossRef(ecr).

     node(fn, tn).arc(fa, ta).run();

     node(fn, tn).arc(fa, ta).run();

   check(countNodes(from) == countNodes(to), "Wrong copy.");

   check(countNodes(from) == countNodes(to), "Wrong copy.");

   check(countArcs(from) == countArcs(to), "Wrong copy.");

   check(countArcs(from) == countArcs(to), "Wrong copy.");

   for (SmartDigraph::NodeIt it(from); it != INVALID; ++it) {

   for (SmartDigraph::NodeIt it(from); it != INVALID; ++it) {

     check(ncr[nr[it]] == it, "Wrong copy.");

     check(ncr[nr[it]] == it, "Wrong copy.");

   check(tn == nr[fn], "Wrong copy.");

   check(tn == nr[fn], "Wrong copy.");

   check(ta == er[fa], "Wrong copy.");

   check(ta == er[fa], "Wrong copy.");

   // Test repeated copy

   // Test repeated copy

   digraphCopy(from, to).run();

   digraphCopy(from, to).run();

   check(countNodes(from) == countNodes(to), "Wrong copy.");

   check(countNodes(from) == countNodes(to), "Wrong copy.");

   check(countArcs(from) == countArcs(to), "Wrong copy.");

   check(countArcs(from) == countArcs(to), "Wrong copy.");

 }

 }

 void graph_copy_test() {

 void graph_copy_test() {

   check(ta == ar[fa], "Wrong copy.");

   check(ta == ar[fa], "Wrong copy.");

   check(te == er[fe], "Wrong copy.");

   check(te == er[fe], "Wrong copy.");

   // Test repeated copy

   // Test repeated copy

   graphCopy(from, to).run();

   graphCopy(from, to).run();

   check(countNodes(from) == countNodes(to), "Wrong copy.");

   check(countNodes(from) == countNodes(to), "Wrong copy.");

   check(countEdges(from) == countEdges(to), "Wrong copy.");

   check(countEdges(from) == countEdges(to), "Wrong copy.");

   check(countArcs(from) == countArcs(to), "Wrong copy.");

   check(countArcs(from) == countArcs(to), "Wrong copy.");

 }

 }