1.1 --- a/test/graph_copy_test.cc	Fri Aug 05 00:12:23 2011 +0200
     1.2 +++ b/test/graph_copy_test.cc	Fri Aug 05 00:17:29 2011 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2008
     1.8 + * Copyright (C) 2003-2011
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -70,7 +70,7 @@
    1.13      nodeRef(nr).arcRef(er).
    1.14      nodeCrossRef(ncr).arcCrossRef(ecr).
    1.15      node(fn, tn).arc(fa, ta).run();
    1.16 -  
    1.17 +
    1.18    check(countNodes(from) == countNodes(to), "Wrong copy.");
    1.19    check(countArcs(from) == countArcs(to), "Wrong copy.");
    1.20  
    1.21 @@ -98,7 +98,7 @@
    1.22  
    1.23    // Test repeated copy
    1.24    digraphCopy(from, to).run();
    1.25 -  
    1.26 +
    1.27    check(countNodes(from) == countNodes(to), "Wrong copy.");
    1.28    check(countArcs(from) == countArcs(to), "Wrong copy.");
    1.29  }
    1.30 @@ -200,7 +200,7 @@
    1.31  
    1.32    // Test repeated copy
    1.33    graphCopy(from, to).run();
    1.34 -  
    1.35 +
    1.36    check(countNodes(from) == countNodes(to), "Wrong copy.");
    1.37    check(countEdges(from) == countEdges(to), "Wrong copy.");
    1.38    check(countArcs(from) == countArcs(to), "Wrong copy.");