Changeset 956:141f9c0db4a3 in lemon for lemon/hartmann_orlin_mmc.h

Timestamp:

03/06/10 15:35:12 (14 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

957:f802439d2b58, 959:38213abd2911, 1041:f112c18bc304

Phase:

public

Message:

Unify the sources (#339)

File:

• lemon/hartmann_orlin_mmc.h (modified) (6 diffs)

lemon/hartmann_orlin_mmc.h

@@ -1 @@
-/* -*- C++ -*-
+/* -*- mode: C++; indent-tabs-mode: nil; -*-
  *
- * This file is a part of LEMON, a generic C++ optimization library
+ * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2008
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ -344 +344 @@
       init();
       findComponents();
-      
+
       // Find the minimum cycle mean in the components
       for (int comp = 0; comp < _comp_num; ++comp) {
         if (!initComponent(comp)) continue;
         processRounds();
-        
+
         // Update the best cycle (global minimum mean cycle)
-        if ( _curr_found && (!_best_found || 
+        if ( _curr_found && (!_best_found ||
              _curr_cost * _best_size < _best_cost * _curr_size) ) {
           _best_found = true;
@@ -504 +504 @@
       if (n < 1 || (n == 1 && _out_arcs[(*_nodes)[0]].size() == 0)) {
         return false;
-      }      
+      }
       for (int i = 0; i < n; ++i) {
         _data[(*_nodes)[i]].resize(n + 1, PathData(INF));
@@ -577 +577 @@
       }
     }
-    
+
     // Check early termination
     bool checkTermination(int k) {
@@ -587 +587 @@
       int size;
       Node u;
-      
+
       // Search for cycles that are already found
       _curr_found = false;
@@ -608 +608 @@
           level[u] = Pair(i, j);
           if (j != 0) {
-            u = _gr.source(_data[u][j].pred);
-          }
+            u = _gr.source(_data[u][j].pred);
+          }
         }
       }