Changeset 956:141f9c0db4a3 in lemon for test/min_mean_cycle_test.cc

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:

• test/min_mean_cycle_test.cc (modified) (7 diffs)

test/min_mean_cycle_test.cc

@@ -3 +3 @@
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ -62 +62 @@
   "7 7    4    4    4   -1   0  0  0  1\n";
 
-                        
+
 // Check the interface of an MMC algorithm
 template <typename GR, typename Cost>
@@ -78 +78 @@
       MmcAlg mmc(me.g, me.cost);
       const MmcAlg& const_mmc = mmc;
-      
+
       typename MmcAlg::Tolerance tol = const_mmc.tolerance();
       mmc.tolerance(tol);
-      
+
       b = mmc.cycle(p).run();
       b = mmc.findCycleMean();
@@ -93 +93 @@
 
     typedef concepts::ReadMap<typename GR::Arc, Cost> CM;
-  
+
     GR g;
     CM cost;
@@ -154 +154 @@
     checkConcept< MmcClassConcept<GR, float>,
                   KarpMmc<GR, concepts::ReadMap<GR::Arc, float> > >();
-    
+
     // HartmannOrlinMmc
     checkConcept< MmcClassConcept<GR, int>,
@@ -160 +160 @@
     checkConcept< MmcClassConcept<GR, float>,
                   HartmannOrlinMmc<GR, concepts::ReadMap<GR::Arc, float> > >();
-    
+
     // HowardMmc
     checkConcept< MmcClassConcept<GR, int>,
@@ -177 +177 @@
     typedef SmartDigraph GR;
     DIGRAPH_TYPEDEFS(GR);
-    
+
     GR gr;
     IntArcMap l1(gr), l2(gr), l3(gr), l4(gr);
     IntArcMap c1(gr), c2(gr), c3(gr), c4(gr);
-    
+
     std::istringstream input(test_lgf);
     digraphReader(gr, input).