diff -r 7f6e2bd76654 -r 141f9c0db4a3 test/matching_test.cc
--- a/test/matching_test.cc	Wed Mar 17 12:35:52 2010 +0100
+++ b/test/matching_test.cc	Sat Mar 06 14:35:12 2010 +0000
@@ -2,7 +2,7 @@
  *
  * 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).
  *
@@ -134,7 +134,7 @@
   mat_test.startSparse();
   mat_test.startDense();
   mat_test.run();
-  
+
   const_mat_test.matchingSize();
   const_mat_test.matching(e);
   const_mat_test.matching(n);
@@ -143,7 +143,7 @@
   e = mmap[n];
   const_mat_test.mate(n);
 
-  MaxMatching<Graph>::Status stat = 
+  MaxMatching<Graph>::Status stat =
     const_mat_test.status(n);
   const MaxMatching<Graph>::StatusMap& smap =
     const_mat_test.statusMap();
@@ -170,7 +170,7 @@
   mat_test.init();
   mat_test.start();
   mat_test.run();
-  
+
   const_mat_test.matchingWeight();
   const_mat_test.matchingSize();
   const_mat_test.matching(e);
@@ -179,7 +179,7 @@
     const_mat_test.matchingMap();
   e = mmap[n];
   const_mat_test.mate(n);
-  
+
   int k = 0;
   const_mat_test.dualValue();
   const_mat_test.nodeValue(n);
@@ -207,7 +207,7 @@
   mat_test.init();
   mat_test.start();
   mat_test.run();
-  
+
   const_mat_test.matchingWeight();
   const_mat_test.matching(e);
   const_mat_test.matching(n);
@@ -215,7 +215,7 @@
     const_mat_test.matchingMap();
   e = mmap[n];
   const_mat_test.mate(n);
-  
+
   int k = 0;
   const_mat_test.dualValue();
   const_mat_test.nodeValue(n);
@@ -425,7 +425,7 @@
     {
       MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight);
       bool result = mwpm.run();
-      
+
       check(result == perfect, "Perfect matching found");
       if (perfect) {
         checkWeightedPerfectMatching(graph, weight, mwpm);
@@ -436,7 +436,7 @@
       MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight);
       mwpm.init();
       bool result = mwpm.start();
-      
+
       check(result == perfect, "Perfect matching found");
       if (perfect) {
         checkWeightedPerfectMatching(graph, weight, mwpm);