diff -r 9eac00ea588f -r dceba191c00d test/graph_copy_test.cc
--- a/test/graph_copy_test.cc	Fri Aug 09 14:07:27 2013 +0200
+++ b/test/graph_copy_test.cc	Fri Aug 09 11:28:17 2013 +0200
@@ -2,7 +2,7 @@
  *
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2013
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
  *
@@ -53,7 +53,7 @@
       if (i == 0 && j == 0) fa = arc;
     }
   }
-  
+
   // Test digraph copy
   GR to;
   typename GR::template NodeMap<int> tnm(to);
@@ -72,7 +72,7 @@
     nodeRef(nr).arcRef(er).
     nodeCrossRef(ncr).arcCrossRef(ecr).
     node(fn, tn).arc(fa, ta).run();
-  
+
   check(countNodes(from) == countNodes(to), "Wrong copy.");
   check(countArcs(from) == countArcs(to), "Wrong copy.");
 
@@ -100,7 +100,7 @@
 
   // Test repeated copy
   digraphCopy(from, to).run();
-  
+
   check(countNodes(from) == countNodes(to), "Wrong copy.");
   check(countArcs(from) == countArcs(to), "Wrong copy.");
 }
@@ -203,7 +203,7 @@
 
   // Test repeated copy
   graphCopy(from, to).run();
-  
+
   check(countNodes(from) == countNodes(to), "Wrong copy.");
   check(countEdges(from) == countEdges(to), "Wrong copy.");
   check(countArcs(from) == countArcs(to), "Wrong copy.");
@@ -366,7 +366,7 @@
 
   // Test repeated copy
   bpGraphCopy(from, to).run();
-  
+
   check(countNodes(from) == countNodes(to), "Wrong copy.");
   check(countRedNodes(from) == countRedNodes(to), "Wrong copy.");
   check(countBlueNodes(from) == countBlueNodes(to), "Wrong copy.");