1.1 --- a/test/graph_copy_test.cc	Sun Jul 13 16:46:56 2008 +0100
     1.2 +++ b/test/graph_copy_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 @@ -122,7 +122,7 @@
    1.13        if (i == 0 && j == 0) fe = edge;
    1.14      }
    1.15    }
    1.16 -  
    1.17 +
    1.18    ListGraph to;
    1.19    ListGraph::NodeMap<int> tnm(to);
    1.20    ListGraph::ArcMap<int> tam(to);
    1.21 @@ -160,12 +160,12 @@
    1.22    for (SmartGraph::EdgeIt it(from); it != INVALID; ++it) {
    1.23      check(ecr[er[it]] == it, "Wrong copy.");
    1.24      check(fem[it] == tem[er[it]], "Wrong copy.");
    1.25 -    check(nr[from.u(it)] == to.u(er[it]) || nr[from.u(it)] == to.v(er[it]), 
    1.26 -	  "Wrong copy.");
    1.27 -    check(nr[from.v(it)] == to.u(er[it]) || nr[from.v(it)] == to.v(er[it]), 
    1.28 -	  "Wrong copy.");
    1.29 -    check((from.u(it) != from.v(it)) == (to.u(er[it]) != to.v(er[it])), 
    1.30 -	  "Wrong copy.");
    1.31 +    check(nr[from.u(it)] == to.u(er[it]) || nr[from.u(it)] == to.v(er[it]),
    1.32 +          "Wrong copy.");
    1.33 +    check(nr[from.v(it)] == to.u(er[it]) || nr[from.v(it)] == to.v(er[it]),
    1.34 +          "Wrong copy.");
    1.35 +    check((from.u(it) != from.v(it)) == (to.u(er[it]) != to.v(er[it])),
    1.36 +          "Wrong copy.");
    1.37    }
    1.38  
    1.39    for (ListGraph::NodeIt it(to); it != INVALID; ++it) {
    1.40 @@ -188,5 +188,5 @@
    1.41    digraph_copy_test();
    1.42    graph_copy_test();
    1.43  
    1.44 -  return 0; 
    1.45 +  return 0;
    1.46  }