1.1 --- a/lemon/hao_orlin.h	Sun Dec 21 20:47:15 2008 +0100
     1.2 +++ b/lemon/hao_orlin.h	Thu Jan 01 00:00:00 2009 +0100
     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-2008
     1.8 + * Copyright (C) 2003-2009
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -238,7 +238,7 @@
    1.13          for (NodeIt t(_graph); t != INVALID; ++t) {
    1.14            if (reached[t]) continue;
    1.15            _sets.push_front(std::list<int>());
    1.16 -          
    1.17 +
    1.18            queue[qlast++] = t;
    1.19            reached.set(t, true);
    1.20  
    1.21 @@ -538,7 +538,7 @@
    1.22          for (NodeIt t(_graph); t != INVALID; ++t) {
    1.23            if (reached[t]) continue;
    1.24            _sets.push_front(std::list<int>());
    1.25 -          
    1.26 +
    1.27            queue[qlast++] = t;
    1.28            reached.set(t, true);
    1.29