Changeset 1270:dceba191c00d in lemon for test/max_clique_test.cc

Timestamp:

08/09/13 11:28:17 (11 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

1271:fb1c7da561ce, 1381:e0ccc1f0268f

Phase:

public

Message:

Apply unify-sources.sh to the source tree

File:

• test/max_clique_test.cc (modified) (8 diffs)

test/max_clique_test.cc

@@ -3 +3 @@
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2010
+ * Copyright (C) 2003-2013
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ -55 +55 @@
   "5 7    14\n"
   "6 7    15\n";
-      
+
 
 // Check with general graphs
@@ -63 +63 @@
   typedef GrossoLocatelliPullanMc<GR> McAlg;
   typedef McAlg::CliqueNodeIt CliqueIt;
-  
+
   // Basic tests
   {
@@ -82 +82 @@
     check(static_cast<GR::Node>(it1) == u && ++it1 == INVALID,
           "Wrong CliqueNodeIt");
-    
+
     GR::Node v = g.addNode();
     check(mc.run(rule) == McAlg::ITERATION_LIMIT, "Wrong termination cause");
@@ -110 +110 @@
       .nodeMap("max_clique", max_clique)
       .run();
-    
+
     McAlg mc(g);
     mc.iterationLimit(50);
@@ -134 +134 @@
   typedef GrossoLocatelliPullanMc<FullGraph> McAlg;
   typedef McAlg::CliqueNodeIt CliqueIt;
-  
+
   for (int size = 0; size <= 40; size = size * 3 + 1) {
     GR g(size);
@@ -157 +157 @@
   GridGraph::NodeMap<char> map(g);
   GrossoLocatelliPullanMc<GridGraph> mc(g);
-  
+
   mc.iterationLimit(100);
   check(mc.run(rule) == mc.ITERATION_LIMIT, "Wrong termination cause");
@@ -180 +180 @@
   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::DEGREE_BASED);
   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::PENALTY_BASED);
-                       
+
   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::RANDOM);
   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::DEGREE_BASED);
   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::PENALTY_BASED);
-                       
+
   return 0;
 }