1.1 --- a/test/arc_look_up_test.cc	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/test/arc_look_up_test.cc	Wed Oct 17 19:14:07 2018 +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 @@ -24,7 +24,6 @@
    1.13  
    1.14  using namespace lemon;
    1.15  
    1.16 -const int lgfn = 4;
    1.17  const std::string lgf =
    1.18    "@nodes\n"
    1.19  "label\n"
    1.20 @@ -68,17 +67,17 @@
    1.21    ListDigraph graph;
    1.22    std::istringstream lgfs(lgf);
    1.23    DigraphReader<ListDigraph>(graph, lgfs).run();
    1.24 -  
    1.25 +
    1.26    AllArcLookUp<ListDigraph> lookup(graph);
    1.27 -	
    1.28 +
    1.29    int numArcs = countArcs(graph);
    1.30 -	
    1.31 +
    1.32    int arcCnt = 0;
    1.33    for(ListDigraph::NodeIt n1(graph); n1 != INVALID; ++n1)
    1.34      for(ListDigraph::NodeIt n2(graph); n2 != INVALID; ++n2)
    1.35        for(ListDigraph::Arc a = lookup(n1, n2); a != INVALID;
    1.36 -	  a = lookup(n1, n2, a))
    1.37 -	++arcCnt;
    1.38 +          a = lookup(n1, n2, a))
    1.39 +        ++arcCnt;
    1.40    check(arcCnt==numArcs, "Wrong total number of arcs");
    1.41  
    1.42    return 0;