Changeset 209:765619b7cbb2 in lemon-1.2 for test/heap_test.cc

Timestamp:

07/13/08 20:51:02 (16 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Phase:

public

Message:

Apply unify-sources.sh to the source tree

File:

• test/heap_test.cc (modified) (10 diffs)

test/heap_test.cc

@@ -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
@@ -41 +41 @@
 DIGRAPH_TYPEDEFS(Digraph);
 
-char test_lgf[] = 
-  "@nodes\n" 
-  "label\n"     
-  "0\n" 
-  "1\n" 
-  "2\n" 
-  "3\n" 
-  "4\n" 
-  "5\n" 
-  "6\n" 
-  "7\n" 
-  "8\n" 
-  "9\n" 
-  "@arcs\n" 
-  "             label   capacity\n"     
-  "0    5       0       94\n"   
-  "3    9       1       11\n"   
-  "8    7       2       83\n"   
-  "1    2       3       94\n"   
-  "5    7       4       35\n"   
-  "7    4       5       84\n"   
-  "9    5       6       38\n"   
-  "0    4       7       96\n"   
-  "6    7       8       6\n"    
-  "3    1       9       27\n"   
-  "5    2       10      77\n"   
-  "5    6       11      69\n"   
-  "6    5       12      41\n"   
-  "4    6       13      70\n"   
-  "3    2       14      45\n"   
-  "7    9       15      93\n"   
-  "5    9       16      50\n"   
-  "9    0       17      94\n"   
-  "9    6       18      67\n"   
-  "0    9       19      86\n"   
-  "@attributes\n" 
+char test_lgf[] =
+  "@nodes\n"
+  "label\n"
+  "0\n"
+  "1\n"
+  "2\n"
+  "3\n"
+  "4\n"
+  "5\n"
+  "6\n"
+  "7\n"
+  "8\n"
+  "9\n"
+  "@arcs\n"
+  "                label        capacity\n"
+  "0        5        0        94\n"
+  "3        9        1        11\n"
+  "8        7        2        83\n"
+  "1        2        3        94\n"
+  "5        7        4        35\n"
+  "7        4        5        84\n"
+  "9        5        6        38\n"
+  "0        4        7        96\n"
+  "6        7        8        6\n"
+  "3        1        9        27\n"
+  "5        2        10        77\n"
+  "5        6        11        69\n"
+  "6        5        12        41\n"
+  "4        6        13        70\n"
+  "3        2        14        45\n"
+  "7        9        15        93\n"
+  "5        9        16        50\n"
+  "9        0        17        94\n"
+  "9        6        18        67\n"
+  "0        9        19        86\n"
+  "@attributes\n"
   "source 3\n";
 
@@ -89 +89 @@
 
   Heap heap(map);
-  
+
   std::vector<int> v(test_len);
 
@@ -108 +108 @@
 
   Heap heap(map);
-  
+
   std::vector<int> v(test_len);
 
@@ -129 +129 @@
 
 template <typename Heap>
-void dijkstraHeapTest(const Digraph& digraph, const IntArcMap& length, 
-                      Node source) {
-  
+void dijkstraHeapTest(const Digraph& digraph, const IntArcMap& length,
+                      Node source) {
+
   typename Dijkstra<Digraph, IntArcMap>::template DefStandardHeap<Heap>::
     Create dijkstra(digraph, length);
@@ -138 +138 @@
 
   for(ArcIt a(digraph); a != INVALID; ++a) {
-    Node s = digraph.source(a); 
+    Node s = digraph.source(a);
     Node t = digraph.target(a);
     if (dijkstra.reached(s)) {
       check( dijkstra.dist(t) - dijkstra.dist(s) <= length[a],
-             "Error in a shortest path tree!");
+                   "Error in a shortest path tree!");
     }
   }
@@ -151 +151 @@
       Node s = digraph.source(a);
       check( dijkstra.dist(n) - dijkstra.dist(s) == length[a],
-             "Error in a shortest path tree!");
+             "Error in a shortest path tree!");
     }
   }
@@ -162 +162 @@
   typedef int Prio;
   typedef RangeMap<int> ItemIntMap;
-  
+
   Digraph digraph;
   IntArcMap length(digraph);
@@ -171 +171 @@
     arcMap("capacity", length).
     node("source", source).
-    run();  
- 
+    run();
+
   {
     typedef BinHeap<Prio, ItemIntMap> IntHeap;
@@ -178 +178 @@
     heapSortTest<IntHeap>();
     heapIncreaseTest<IntHeap>();
-    
+
     typedef BinHeap<Prio, IntNodeMap > NodeHeap;
     checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();