1.1 --- a/test/fractional_matching_test.cc Wed Mar 17 12:35:52 2010 +0100
1.2 +++ b/test/fractional_matching_test.cc Sat Mar 06 14:35:12 2010 +0000
1.3 @@ -2,7 +2,7 @@
1.4 *
1.5 * This file is a part of LEMON, a generic C++ optimization library.
1.6 *
1.7 - * Copyright (C) 2003-2009
1.8 + * Copyright (C) 2003-2010
1.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.11 *
1.12 @@ -238,7 +238,7 @@
1.13
1.14 for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
1.15 check((e == mfm.matching(graph.u(e)) ? 1 : 0) +
1.16 - (e == mfm.matching(graph.v(e)) ? 1 : 0) ==
1.17 + (e == mfm.matching(graph.v(e)) ? 1 : 0) ==
1.18 mfm.matching(e), "Invalid matching");
1.19 }
1.20
1.21 @@ -292,7 +292,7 @@
1.22 }
1.23 for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
1.24 check((e == mfm.matching(graph.u(e)) ? 1 : 0) +
1.25 - (e == mfm.matching(graph.v(e)) ? 1 : 0) ==
1.26 + (e == mfm.matching(graph.v(e)) ? 1 : 0) ==
1.27 mfm.matching(e), "Invalid matching");
1.28 }
1.29 } else {
1.30 @@ -350,7 +350,7 @@
1.31
1.32 for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
1.33 check((e == mwfm.matching(graph.u(e)) ? 1 : 0) +
1.34 - (e == mwfm.matching(graph.v(e)) ? 1 : 0) ==
1.35 + (e == mwfm.matching(graph.v(e)) ? 1 : 0) ==
1.36 mwfm.matching(e), "Invalid matching");
1.37 }
1.38
1.39 @@ -410,7 +410,7 @@
1.40
1.41 for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {
1.42 check((e == mwpfm.matching(graph.u(e)) ? 1 : 0) +
1.43 - (e == mwpfm.matching(graph.v(e)) ? 1 : 0) ==
1.44 + (e == mwpfm.matching(graph.v(e)) ? 1 : 0) ==
1.45 mwpfm.matching(e), "Invalid matching");
1.46 }
1.47