COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/11/04 17:42:11 (18 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@789
Message:

Finished MinLengthPaths?: a specialization of MinCostFlows?.

File:
1 edited

Legend:

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

    r520 r607  
    7070  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46");
    7171
     72  check(  surb_test.checkComplementarySlackness(), "Complementary slackness conditions are not met.");
     73
    7274  typedef DirPath<ListGraph> DPath;
    7375  DPath P(graph);
     
    8183  k=1;
    8284  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,"One path, total length should be 19");
     85
     86  check(  surb_test.checkComplementarySlackness(), "Complementary slackness conditions are not met.");
    8387 
    8488  surb_test.getPath(P,0);
Note: See TracChangeset for help on using the changeset viewer.