1.1 --- a/lemon/cycle_canceling.h	Fri Aug 09 14:07:27 2013 +0200
     1.2 +++ b/lemon/cycle_canceling.h	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-2010
     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 @@ -783,7 +783,7 @@
    1.13  
    1.14        return OPTIMAL;
    1.15      }
    1.16 -    
    1.17 +
    1.18      // Check if the upper bound is greater or equal to the lower bound
    1.19      // on each arc.
    1.20      bool checkBoundMaps() {
    1.21 @@ -960,7 +960,7 @@
    1.22        hw_mmc.cycle(cycle);
    1.23        buildResidualNetwork();
    1.24        while (true) {
    1.25 -        
    1.26 +
    1.27          typename HwMmc::TerminationCause hw_tc =
    1.28              hw_mmc.findCycleMean(hw_iter_limit);
    1.29          if (hw_tc == HwMmc::ITERATION_LIMIT) {
    1.30 @@ -976,7 +976,7 @@
    1.31            if (!(hw_tc == HwMmc::OPTIMAL && hw_mmc.cycleCost() < 0)) break;
    1.32            hw_mmc.findCycle();
    1.33          }
    1.34 -        
    1.35 +
    1.36          // Compute delta value
    1.37          Value delta = INF;
    1.38          for (SPathArcIt a(cycle); a != INVALID; ++a) {