diff -r f22bc76370b2 -r f1398882a928 test/dfs_test.cc
--- a/test/dfs_test.cc	Fri Aug 05 09:33:42 2011 +0200
+++ b/test/dfs_test.cc	Mon Aug 08 12:36:16 2011 +0200
@@ -2,7 +2,7 @@
  *
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2011
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
  *
@@ -86,7 +86,7 @@
     e = const_dfs_test.nextArc();
     b = const_dfs_test.emptyQueue();
     i = const_dfs_test.queueSize();
-    
+
     dfs_test.start();
     dfs_test.start(t);
     dfs_test.start(am);
@@ -112,7 +112,7 @@
     concepts::ReadWriteMap<Node,int> dist_map;
     concepts::ReadWriteMap<Node,bool> reached_map;
     concepts::WriteMap<Node,bool> processed_map;
-    
+
     dfs_test
       .predMap(pred_map)
       .distMap(dist_map)
@@ -129,7 +129,7 @@
     e = dfs_test.nextArc();
     b = dfs_test.emptyQueue();
     i = dfs_test.queueSize();
-    
+
     dfs_test.start();
     dfs_test.start(t);
     dfs_test.start(am);
@@ -219,7 +219,7 @@
   Dfs<Digraph> dfs(G);
   check(dfs.run(s1,t1) && dfs.reached(t1),"Node 3 is reachable from Node 6.");
   }
-  
+
   {
     NullMap<Node,Arc> myPredMap;
     dfs(G).predMap(myPredMap).run(s);