Changeset 956:141f9c0db4a3 in lemon for test/matching_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/matching_test.cc (modified) (9 diffs)

test/matching_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).
@@ -135 +135 @@
   mat_test.startDense();
   mat_test.run();
-  
+
   const_mat_test.matchingSize();
   const_mat_test.matching(e);
@@ -144 +144 @@
   const_mat_test.mate(n);
 
-  MaxMatching<Graph>::Status stat = 
+  MaxMatching<Graph>::Status stat =
     const_mat_test.status(n);
   const MaxMatching<Graph>::StatusMap& smap =
@@ -171 +171 @@
   mat_test.start();
   mat_test.run();
-  
+
   const_mat_test.matchingWeight();
   const_mat_test.matchingSize();
@@ -180 +180 @@
   e = mmap[n];
   const_mat_test.mate(n);
-  
+
   int k = 0;
   const_mat_test.dualValue();
@@ -208 +208 @@
   mat_test.start();
   mat_test.run();
-  
+
   const_mat_test.matchingWeight();
   const_mat_test.matching(e);
@@ -216 +216 @@
   e = mmap[n];
   const_mat_test.mate(n);
-  
+
   int k = 0;
   const_mat_test.dualValue();
@@ -426 +426 @@
       MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight);
       bool result = mwpm.run();
-      
+
       check(result == perfect, "Perfect matching found");
       if (perfect) {
@@ -437 +437 @@
       mwpm.init();
       bool result = mwpm.start();
-      
+
       check(result == perfect, "Perfect matching found");
       if (perfect) {