Changeset 956:141f9c0db4a3 in lemon for test/fractional_matching_test.cc
 Timestamp:
 03/06/10 15:35:12 (12 years ago)
 Branch:
 default
 Children:
 957:f802439d2b58, 959:38213abd2911, 1041:f112c18bc304
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

test/fractional_matching_test.cc
r951 r956 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 239 239 for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) { 240 240 check((e == mfm.matching(graph.u(e)) ? 1 : 0) + 241 (e == mfm.matching(graph.v(e)) ? 1 : 0) == 241 (e == mfm.matching(graph.v(e)) ? 1 : 0) == 242 242 mfm.matching(e), "Invalid matching"); 243 243 } … … 293 293 for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) { 294 294 check((e == mfm.matching(graph.u(e)) ? 1 : 0) + 295 (e == mfm.matching(graph.v(e)) ? 1 : 0) == 295 (e == mfm.matching(graph.v(e)) ? 1 : 0) == 296 296 mfm.matching(e), "Invalid matching"); 297 297 } … … 351 351 for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) { 352 352 check((e == mwfm.matching(graph.u(e)) ? 1 : 0) + 353 (e == mwfm.matching(graph.v(e)) ? 1 : 0) == 353 (e == mwfm.matching(graph.v(e)) ? 1 : 0) == 354 354 mwfm.matching(e), "Invalid matching"); 355 355 } … … 411 411 for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) { 412 412 check((e == mwpfm.matching(graph.u(e)) ? 1 : 0) + 413 (e == mwpfm.matching(graph.v(e)) ? 1 : 0) == 413 (e == mwpfm.matching(graph.v(e)) ? 1 : 0) == 414 414 mwpfm.matching(e), "Invalid matching"); 415 415 }
Note: See TracChangeset
for help on using the changeset viewer.