1.1 --- a/test/bfs_test.cc	Fri Aug 05 09:33:42 2011 +0200
     1.2 +++ b/test/bfs_test.cc	Mon Aug 08 12:36:16 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-2009
     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 @@ -83,7 +83,7 @@
    1.13      n = const_bfs_test.nextNode();
    1.14      b = const_bfs_test.emptyQueue();
    1.15      i = const_bfs_test.queueSize();
    1.16 -    
    1.17 +
    1.18      bfs_test.start();
    1.19      bfs_test.start(t);
    1.20      bfs_test.start(nm);
    1.21 @@ -104,12 +104,12 @@
    1.22        ::SetStandardProcessedMap
    1.23        ::SetProcessedMap<concepts::WriteMap<Node,bool> >
    1.24        ::Create bfs_test(G);
    1.25 -      
    1.26 +
    1.27      concepts::ReadWriteMap<Node,Arc> pred_map;
    1.28      concepts::ReadWriteMap<Node,int> dist_map;
    1.29      concepts::ReadWriteMap<Node,bool> reached_map;
    1.30      concepts::WriteMap<Node,bool> processed_map;
    1.31 -    
    1.32 +
    1.33      bfs_test
    1.34        .predMap(pred_map)
    1.35        .distMap(dist_map)
    1.36 @@ -119,7 +119,7 @@
    1.37      bfs_test.run(s);
    1.38      bfs_test.run(s,t);
    1.39      bfs_test.run();
    1.40 -    
    1.41 +
    1.42      bfs_test.init();
    1.43      bfs_test.addSource(s);
    1.44      n = bfs_test.processNextNode();
    1.45 @@ -128,7 +128,7 @@
    1.46      n = bfs_test.nextNode();
    1.47      b = bfs_test.emptyQueue();
    1.48      i = bfs_test.queueSize();
    1.49 -    
    1.50 +
    1.51      bfs_test.start();
    1.52      bfs_test.start(t);
    1.53      bfs_test.start(nm);