1.1 --- a/test/arc_look_up_test.cc	Fri Aug 09 14:07:27 2013 +0200
     1.2 +++ b/test/arc_look_up_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-2009
     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 @@ -68,17 +68,17 @@
    1.13    ListDigraph graph;
    1.14    std::istringstream lgfs(lgf);
    1.15    DigraphReader<ListDigraph>(graph, lgfs).run();
    1.16 -  
    1.17 +
    1.18    AllArcLookUp<ListDigraph> lookup(graph);
    1.19 -	
    1.20 +
    1.21    int numArcs = countArcs(graph);
    1.22 -	
    1.23 +
    1.24    int arcCnt = 0;
    1.25    for(ListDigraph::NodeIt n1(graph); n1 != INVALID; ++n1)
    1.26      for(ListDigraph::NodeIt n2(graph); n2 != INVALID; ++n2)
    1.27        for(ListDigraph::Arc a = lookup(n1, n2); a != INVALID;
    1.28 -	  a = lookup(n1, n2, a))
    1.29 -	++arcCnt;
    1.30 +          a = lookup(n1, n2, a))
    1.31 +        ++arcCnt;
    1.32    check(arcCnt==numArcs, "Wrong total number of arcs");
    1.33  
    1.34    return 0;