COIN-OR::LEMON - Graph Library

Changeset 877:141f9c0db4a3 in lemon-1.2 for lemon/hartmann_orlin_mmc.h


Ignore:
Timestamp:
03/06/10 15:35:12 (10 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
878:f802439d2b58, 880:38213abd2911, 909:f112c18bc304
Phase:
public
Message:

Unify the sources (#339)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/hartmann_orlin_mmc.h

    r864 r877  
    1 /* -*- C++ -*-
     1/* -*- mode: C++; indent-tabs-mode: nil; -*-
    22 *
    3  * This file is a part of LEMON, a generic C++ optimization library
     3 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    344344      init();
    345345      findComponents();
    346      
     346
    347347      // Find the minimum cycle mean in the components
    348348      for (int comp = 0; comp < _comp_num; ++comp) {
    349349        if (!initComponent(comp)) continue;
    350350        processRounds();
    351        
     351
    352352        // Update the best cycle (global minimum mean cycle)
    353         if ( _curr_found && (!_best_found || 
     353        if ( _curr_found && (!_best_found ||
    354354             _curr_cost * _best_size < _best_cost * _curr_size) ) {
    355355          _best_found = true;
     
    504504      if (n < 1 || (n == 1 && _out_arcs[(*_nodes)[0]].size() == 0)) {
    505505        return false;
    506       }     
     506      }
    507507      for (int i = 0; i < n; ++i) {
    508508        _data[(*_nodes)[i]].resize(n + 1, PathData(INF));
     
    577577      }
    578578    }
    579    
     579
    580580    // Check early termination
    581581    bool checkTermination(int k) {
     
    587587      int size;
    588588      Node u;
    589      
     589
    590590      // Search for cycles that are already found
    591591      _curr_found = false;
     
    608608          level[u] = Pair(i, j);
    609609          if (j != 0) {
    610             u = _gr.source(_data[u][j].pred);
    611           }
     610            u = _gr.source(_data[u][j].pred);
     611          }
    612612        }
    613613      }
Note: See TracChangeset for help on using the changeset viewer.