1.1 --- a/src/test/minlengthpaths_test.cc	Thu Sep 02 17:11:04 2004 +0000
     1.2 +++ b/src/test/minlengthpaths_test.cc	Thu Sep 02 17:30:06 2004 +0000
     1.3 @@ -58,9 +58,11 @@
     1.4    MinLengthPaths< ListGraph, ListGraph::EdgeMap<int> >
     1.5      surb_test(graph, length);
     1.6  
     1.7 -  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46");
     1.8 +  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,
     1.9 +	  "Two paths, total length should be 46");
    1.10  
    1.11 -  check(  surb_test.checkComplementarySlackness(), "Complementary slackness conditions are not met.");
    1.12 +  check(  surb_test.checkComplementarySlackness(),
    1.13 +	  "Complementary slackness conditions are not met.");
    1.14  
    1.15    //  typedef DirPath<ListGraph> DPath;
    1.16    //  DPath P(graph);
    1.17 @@ -75,9 +77,11 @@
    1.18    */  
    1.19  
    1.20    k=1;
    1.21 -  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,"One path, total length should be 19");
    1.22 +  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,
    1.23 +	  "One path, total length should be 19");
    1.24  
    1.25 -  check(  surb_test.checkComplementarySlackness(), "Complementary slackness conditions are not met.");
    1.26 +  check(  surb_test.checkComplementarySlackness(),
    1.27 +	  "Complementary slackness conditions are not met.");
    1.28   
    1.29    //  surb_test.getPath(P,0);
    1.30    //  check(P.length() == 4, "First path should contain 4 edges.");