1.1 --- a/test/graph_test.cc	Sun Jul 13 16:46:56 2008 +0100
     1.2 +++ b/test/graph_test.cc	Sun Jul 13 19:51:02 2008 +0100
     1.3 @@ -1,6 +1,6 @@
     1.4 -/* -*- C++ -*-
     1.5 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
     1.6   *
     1.7 - * This file is a part of LEMON, a generic C++ optimization library
     1.8 + * This file is a part of LEMON, a generic C++ optimization library.
     1.9   *
    1.10   * Copyright (C) 2003-2008
    1.11   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.12 @@ -33,13 +33,13 @@
    1.13    { // Checking graph components
    1.14      checkConcept<BaseGraphComponent, BaseGraphComponent >();
    1.15  
    1.16 -    checkConcept<IDableGraphComponent<>, 
    1.17 +    checkConcept<IDableGraphComponent<>,
    1.18        IDableGraphComponent<> >();
    1.19  
    1.20 -    checkConcept<IterableGraphComponent<>, 
    1.21 +    checkConcept<IterableGraphComponent<>,
    1.22        IterableGraphComponent<> >();
    1.23  
    1.24 -    checkConcept<MappableGraphComponent<>, 
    1.25 +    checkConcept<MappableGraphComponent<>,
    1.26        MappableGraphComponent<> >();
    1.27    }
    1.28    { // Checking skeleton graph
    1.29 @@ -134,7 +134,7 @@
    1.30  //       check(g.row(g(i, j)) == j, "Wrong row");
    1.31  //     }
    1.32  //   }
    1.33 -  
    1.34 +
    1.35  //   for (int i = 0; i < w; ++i) {
    1.36  //     for (int j = 0; j < h - 1; ++j) {
    1.37  //       check(g.source(g.down(g(i, j))) == g(i, j), "Wrong down");
    1.38 @@ -154,17 +154,17 @@
    1.39  //   for (int j = 0; j < h; ++j) {
    1.40  //     for (int i = 0; i < w - 1; ++i) {
    1.41  //       check(g.source(g.right(g(i, j))) == g(i, j), "Wrong right");
    1.42 -//       check(g.target(g.right(g(i, j))) == g(i + 1, j), "Wrong right");      
    1.43 +//       check(g.target(g.right(g(i, j))) == g(i + 1, j), "Wrong right");
    1.44  //     }
    1.45 -//     check(g.right(g(w - 1, j)) == INVALID, "Wrong right");    
    1.46 +//     check(g.right(g(w - 1, j)) == INVALID, "Wrong right");
    1.47  //   }
    1.48  
    1.49  //   for (int j = 0; j < h; ++j) {
    1.50  //     for (int i = 1; i < w; ++i) {
    1.51  //       check(g.source(g.left(g(i, j))) == g(i, j), "Wrong left");
    1.52 -//       check(g.target(g.left(g(i, j))) == g(i - 1, j), "Wrong left");      
    1.53 +//       check(g.target(g.left(g(i, j))) == g(i - 1, j), "Wrong left");
    1.54  //     }
    1.55 -//     check(g.left(g(0, j)) == INVALID, "Wrong left");    
    1.56 +//     check(g.left(g(0, j)) == INVALID, "Wrong left");
    1.57  //   }
    1.58  // }
    1.59