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

test/fractional_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).
@@ -239 +239 @@
   for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
     check((e == mfm.matching(graph.u(e)) ? 1 : 0) +
-          (e == mfm.matching(graph.v(e)) ? 1 : 0) == 
+          (e == mfm.matching(graph.v(e)) ? 1 : 0) ==
           mfm.matching(e), "Invalid matching");
   }
@@ -293 +293 @@
     for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
       check((e == mfm.matching(graph.u(e)) ? 1 : 0) +
-            (e == mfm.matching(graph.v(e)) ? 1 : 0) == 
+            (e == mfm.matching(graph.v(e)) ? 1 : 0) ==
             mfm.matching(e), "Invalid matching");
     }
@@ -351 +351 @@
   for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
     check((e == mwfm.matching(graph.u(e)) ? 1 : 0) +
-          (e == mwfm.matching(graph.v(e)) ? 1 : 0) == 
+          (e == mwfm.matching(graph.v(e)) ? 1 : 0) ==
           mwfm.matching(e), "Invalid matching");
   }
@@ -411 +411 @@
   for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
     check((e == mwpfm.matching(graph.u(e)) ? 1 : 0) +
-          (e == mwpfm.matching(graph.v(e)) ? 1 : 0) == 
+          (e == mwpfm.matching(graph.v(e)) ? 1 : 0) ==
           mwpfm.matching(e), "Invalid matching");
   }