COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
06/02/04 11:45:50 (16 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@908
Message:

Seems to work. More tests required.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/athos/min_cost_flow.cc

    r662 r672  
    1212
    1313bool passed = true;
    14 /*
     14
    1515void check(bool rc, char *msg="") {
    1616  passed = passed && rc;
     
    2121  }
    2222}
    23 */
     23
    2424
    2525
     
    9191  min_cost_flow_test.run();
    9292  //int k=1;
     93  check(min_cost_flow_test.checkOptimality(), "Is the primal-dual solution pair really optimal?");
    9394
    9495  /*
     
    110111  check(min_cost_flow_test.checkComplementarySlackness(), "Is the primal-dual solution pair really optimal?");
    111112
    112 
     113  */
    113114  cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
    114115       << endl;
    115116
    116117  return passed ? 0 : 1;
    117   */
     118 
    118119}
Note: See TracChangeset for help on using the changeset viewer.