Changes in test/tsp_test.cc [1106:1ba759c76810:1092:dceba191c00d] in lemon-main

File:

• test/tsp_test.cc (modified) (3 diffs)

test/tsp_test.cc

@@ -67 +67 @@
 
   int node_cnt = 0;
-  for (typename Container::const_iterator it = p.begin(); it != p.end(); ++it)
-    {
-      FullGraph::Node node = *it;
-      if (used[node]) return false;
-      used[node] = true;
-      ++node_cnt;
-    }
+  for (typename Container::const_iterator it = p.begin(); it != p.end(); ++it) {
+    FullGraph::Node node = *it;
+    if (used[node]) return false;
+    used[node] = true;
+    ++node_cnt;
+  }
 
   return (node_cnt == gr.nodeNum());
@@ -133 +132 @@
     int esize = n <= 1 ? 0 : n;
 
-    ConstMap<Edge, int> cost_map(1);
-    TSP alg(g, cost_map);
+    TSP alg(g, constMap<Edge, int>(1));
 
     check(alg.run() == esize, alg_name + ": Wrong total cost");
@@ -267 +265 @@
   tspTestSmall<GreedyTsp<ConstMap<Edge, int> > >("Greedy");
   tspTestSmall<NearestInsertionTsp<ConstMap<Edge, int> > >("Nearest Insertion");
-  tspTestSmall<FarthestInsertionTsp<ConstMap<Edge, int> > >
-    ("Farthest Insertion");
-  tspTestSmall<CheapestInsertionTsp<ConstMap<Edge, int> > >
-    ("Cheapest Insertion");
+  tspTestSmall<FarthestInsertionTsp<ConstMap<Edge, int> > >("Farthest Insertion");
+  tspTestSmall<CheapestInsertionTsp<ConstMap<Edge, int> > >("Cheapest Insertion");
   tspTestSmall<RandomInsertionTsp<ConstMap<Edge, int> > >("Random Insertion");
   tspTestSmall<ChristofidesTsp<ConstMap<Edge, int> > >("Christofides");