1.1 --- a/lemon/karp_mmc.h	Wed Mar 17 12:35:52 2010 +0100
     1.2 +++ b/lemon/karp_mmc.h	Sat Mar 06 14:35:12 2010 +0000
     1.3 @@ -1,8 +1,8 @@
     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 + * Copyright (C) 2003-2010
    1.12   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.13   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.14   *
    1.15 @@ -191,7 +191,7 @@
    1.16      std::vector<Node> _process;
    1.17  
    1.18      Tolerance _tolerance;
    1.19 -    
    1.20 +
    1.21      // Infinite constant
    1.22      const LargeCost INF;
    1.23  
    1.24 @@ -339,7 +339,7 @@
    1.25        // Initialization and find strongly connected components
    1.26        init();
    1.27        findComponents();
    1.28 -      
    1.29 +
    1.30        // Find the minimum cycle mean in the components
    1.31        for (int comp = 0; comp < _comp_num; ++comp) {
    1.32          if (!initComponent(comp)) continue;
    1.33 @@ -489,7 +489,7 @@
    1.34        int n = _nodes->size();
    1.35        if (n < 1 || (n == 1 && _out_arcs[(*_nodes)[0]].size() == 0)) {
    1.36          return false;
    1.37 -      }      
    1.38 +      }
    1.39        for (int i = 0; i < n; ++i) {
    1.40          _data[(*_nodes)[i]].resize(n + 1, PathData(INF));
    1.41        }