Changeset 1008:d216e1c8b3fa in lemon-main for test/matching_test.cc
- Timestamp:
- 11/28/12 11:54:43 (12 years ago)
- Branch:
- default
- Parents:
- 999:00f8d9f9920d (diff), 1007:7e368d9b67f7 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent. - Phase:
- public
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
test/matching_test.cc
r877 r1008 146 146 MaxMatching<Graph>::Status stat = 147 147 const_mat_test.status(n); 148 ignore_unused_variable_warning(stat); 148 149 const MaxMatching<Graph>::StatusMap& smap = 149 150 const_mat_test.statusMap(); -
test/matching_test.cc
r1007 r1008 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-20 095 * Copyright (C) 2003-2010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 135 135 mat_test.startDense(); 136 136 mat_test.run(); 137 137 138 138 const_mat_test.matchingSize(); 139 139 const_mat_test.matching(e); … … 144 144 const_mat_test.mate(n); 145 145 146 MaxMatching<Graph>::Status stat = 146 MaxMatching<Graph>::Status stat = 147 147 const_mat_test.status(n); 148 148 ignore_unused_variable_warning(stat); … … 172 172 mat_test.start(); 173 173 mat_test.run(); 174 174 175 175 const_mat_test.matchingWeight(); 176 176 const_mat_test.matchingSize(); … … 181 181 e = mmap[n]; 182 182 const_mat_test.mate(n); 183 183 184 184 int k = 0; 185 185 const_mat_test.dualValue(); … … 209 209 mat_test.start(); 210 210 mat_test.run(); 211 211 212 212 const_mat_test.matchingWeight(); 213 213 const_mat_test.matching(e); … … 217 217 e = mmap[n]; 218 218 const_mat_test.mate(n); 219 219 220 220 int k = 0; 221 221 const_mat_test.dualValue(); … … 403 403 edgeMap("weight", weight).run(); 404 404 405 MaxMatching<SmartGraph> mm(graph); 406 mm.run(); 407 checkMatching(graph, mm); 408 409 MaxWeightedMatching<SmartGraph> mwm(graph, weight); 410 mwm.run(); 411 checkWeightedMatching(graph, weight, mwm); 412 413 MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight); 414 bool perfect = mwpm.run(); 415 416 check(perfect == (mm.matchingSize() * 2 == countNodes(graph)), 417 "Perfect matching found"); 418 419 if (perfect) { 420 checkWeightedPerfectMatching(graph, weight, mwpm); 405 bool perfect; 406 { 407 MaxMatching<SmartGraph> mm(graph); 408 mm.run(); 409 checkMatching(graph, mm); 410 perfect = 2 * mm.matchingSize() == countNodes(graph); 411 } 412 413 { 414 MaxWeightedMatching<SmartGraph> mwm(graph, weight); 415 mwm.run(); 416 checkWeightedMatching(graph, weight, mwm); 417 } 418 419 { 420 MaxWeightedMatching<SmartGraph> mwm(graph, weight); 421 mwm.init(); 422 mwm.start(); 423 checkWeightedMatching(graph, weight, mwm); 424 } 425 426 { 427 MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight); 428 bool result = mwpm.run(); 429 430 check(result == perfect, "Perfect matching found"); 431 if (perfect) { 432 checkWeightedPerfectMatching(graph, weight, mwpm); 433 } 434 } 435 436 { 437 MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight); 438 mwpm.init(); 439 bool result = mwpm.start(); 440 441 check(result == perfect, "Perfect matching found"); 442 if (perfect) { 443 checkWeightedPerfectMatching(graph, weight, mwpm); 444 } 421 445 } 422 446 }
Note: See TracChangeset
for help on using the changeset viewer.