1.1 --- a/test/dfs_test.cc	Fri Aug 05 09:33:42 2011 +0200
     1.2 +++ b/test/dfs_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 @@ -86,7 +86,7 @@
    1.13      e = const_dfs_test.nextArc();
    1.14      b = const_dfs_test.emptyQueue();
    1.15      i = const_dfs_test.queueSize();
    1.16 -    
    1.17 +
    1.18      dfs_test.start();
    1.19      dfs_test.start(t);
    1.20      dfs_test.start(am);
    1.21 @@ -112,7 +112,7 @@
    1.22      concepts::ReadWriteMap<Node,int> dist_map;
    1.23      concepts::ReadWriteMap<Node,bool> reached_map;
    1.24      concepts::WriteMap<Node,bool> processed_map;
    1.25 -    
    1.26 +
    1.27      dfs_test
    1.28        .predMap(pred_map)
    1.29        .distMap(dist_map)
    1.30 @@ -129,7 +129,7 @@
    1.31      e = dfs_test.nextArc();
    1.32      b = dfs_test.emptyQueue();
    1.33      i = dfs_test.queueSize();
    1.34 -    
    1.35 +
    1.36      dfs_test.start();
    1.37      dfs_test.start(t);
    1.38      dfs_test.start(am);
    1.39 @@ -219,7 +219,7 @@
    1.40    Dfs<Digraph> dfs(G);
    1.41    check(dfs.run(s1,t1) && dfs.reached(t1),"Node 3 is reachable from Node 6.");
    1.42    }
    1.43 -  
    1.44 +
    1.45    {
    1.46      NullMap<Node,Arc> myPredMap;
    1.47      dfs(G).predMap(myPredMap).run(s);