1.1 --- a/test/euler_test.cc	Fri Aug 05 09:33:42 2011 +0200
     1.2 +++ b/test/euler_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 @@ -85,11 +85,11 @@
    1.13  {
    1.14    typedef ListDigraph Digraph;
    1.15    typedef Undirector<Digraph> Graph;
    1.16 -  
    1.17 +
    1.18    {
    1.19      Digraph d;
    1.20      Graph g(d);
    1.21 -    
    1.22 +
    1.23      checkDiEulerIt(d);
    1.24      checkDiEulerIt(g);
    1.25      checkEulerIt(g);
    1.26 @@ -128,7 +128,7 @@
    1.27      Digraph::Node n1 = d.addNode();
    1.28      Digraph::Node n2 = d.addNode();
    1.29      Digraph::Node n3 = d.addNode();
    1.30 -    
    1.31 +
    1.32      d.addArc(n1, n2);
    1.33      d.addArc(n2, n1);
    1.34      d.addArc(n2, n3);
    1.35 @@ -153,7 +153,7 @@
    1.36      Digraph::Node n4 = d.addNode();
    1.37      Digraph::Node n5 = d.addNode();
    1.38      Digraph::Node n6 = d.addNode();
    1.39 -    
    1.40 +
    1.41      d.addArc(n1, n2);
    1.42      d.addArc(n2, n4);
    1.43      d.addArc(n1, n3);
    1.44 @@ -189,7 +189,7 @@
    1.45      Digraph::Node n3 = d.addNode();
    1.46      Digraph::Node n4 = d.addNode();
    1.47      Digraph::Node n5 = d.addNode();
    1.48 -    
    1.49 +
    1.50      d.addArc(n1, n2);
    1.51      d.addArc(n2, n3);
    1.52      d.addArc(n3, n1);
    1.53 @@ -211,7 +211,7 @@
    1.54      Digraph::Node n1 = d.addNode();
    1.55      Digraph::Node n2 = d.addNode();
    1.56      Digraph::Node n3 = d.addNode();
    1.57 -    
    1.58 +
    1.59      d.addArc(n1, n2);
    1.60      d.addArc(n2, n3);
    1.61