diff -r f22bc76370b2 -r f1398882a928 test/bfs_test.cc
--- a/test/bfs_test.cc	Fri Aug 05 09:33:42 2011 +0200
+++ b/test/bfs_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).
  *
@@ -83,7 +83,7 @@
     n = const_bfs_test.nextNode();
     b = const_bfs_test.emptyQueue();
     i = const_bfs_test.queueSize();
-    
+
     bfs_test.start();
     bfs_test.start(t);
     bfs_test.start(nm);
@@ -104,12 +104,12 @@
       ::SetStandardProcessedMap
       ::SetProcessedMap<concepts::WriteMap<Node,bool> >
       ::Create bfs_test(G);
-      
+
     concepts::ReadWriteMap<Node,Arc> pred_map;
     concepts::ReadWriteMap<Node,int> dist_map;
     concepts::ReadWriteMap<Node,bool> reached_map;
     concepts::WriteMap<Node,bool> processed_map;
-    
+
     bfs_test
       .predMap(pred_map)
       .distMap(dist_map)
@@ -119,7 +119,7 @@
     bfs_test.run(s);
     bfs_test.run(s,t);
     bfs_test.run();
-    
+
     bfs_test.init();
     bfs_test.addSource(s);
     n = bfs_test.processNextNode();
@@ -128,7 +128,7 @@
     n = bfs_test.nextNode();
     b = bfs_test.emptyQueue();
     i = bfs_test.queueSize();
-    
+
     bfs_test.start();
     bfs_test.start(t);
     bfs_test.start(nm);