COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
09/02/04 19:30:06 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1085
Message:

Formatting: breaking long lines.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/test/minlengthpaths_test.cc

    r790 r791  
    5959    surb_test(graph, length);
    6060
    61   check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46");
     61  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,
     62          "Two paths, total length should be 46");
    6263
    63   check(  surb_test.checkComplementarySlackness(), "Complementary slackness conditions are not met.");
     64  check(  surb_test.checkComplementarySlackness(),
     65          "Complementary slackness conditions are not met.");
    6466
    6567  //  typedef DirPath<ListGraph> DPath;
     
    7678
    7779  k=1;
    78   check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,"One path, total length should be 19");
     80  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,
     81          "One path, total length should be 19");
    7982
    80   check(  surb_test.checkComplementarySlackness(), "Complementary slackness conditions are not met.");
     83  check(  surb_test.checkComplementarySlackness(),
     84          "Complementary slackness conditions are not met.");
    8185 
    8286  //  surb_test.getPath(P,0);
Note: See TracChangeset for help on using the changeset viewer.