1.1 --- a/test/lgf_test.cc	Fri Aug 09 14:07:27 2013 +0200
     1.2 +++ b/test/lgf_test.cc	Fri Aug 09 11:28:17 2013 +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-2011
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -63,10 +63,10 @@
    1.13    "0 1\n";
    1.14  
    1.15  
    1.16 -int main() 
    1.17 +int main()
    1.18  {
    1.19    {
    1.20 -    ListDigraph d; 
    1.21 +    ListDigraph d;
    1.22      ListDigraph::Node s,t;
    1.23      ListDigraph::ArcMap<int> label(d);
    1.24      std::istringstream input(test_lgf);
    1.25 @@ -93,7 +93,7 @@
    1.26    }
    1.27  
    1.28    {
    1.29 -    ListDigraph d; 
    1.30 +    ListDigraph d;
    1.31      std::istringstream input(test_lgf_nomap);
    1.32      digraphReader(d, input).
    1.33        run();
    1.34 @@ -110,14 +110,14 @@
    1.35    }
    1.36  
    1.37    {
    1.38 -    ListDigraph d; 
    1.39 +    ListDigraph d;
    1.40      std::istringstream input(test_lgf_bad1);
    1.41      bool ok=false;
    1.42      try {
    1.43        digraphReader(d, input).
    1.44          run();
    1.45      }
    1.46 -    catch (FormatError&) 
    1.47 +    catch (FormatError&)
    1.48        {
    1.49          ok = true;
    1.50        }
    1.51 @@ -139,7 +139,7 @@
    1.52    }
    1.53  
    1.54    {
    1.55 -    ListDigraph d; 
    1.56 +    ListDigraph d;
    1.57      std::istringstream input(test_lgf_bad2);
    1.58      bool ok=false;
    1.59      try {