# HG changeset patch
# User alpar
# Date 1094146206 0
# Node ID 7a54630d22b657aa32b2609deb0ca58094464781
# Parent  2b9a43c0d64e116f9f421a03a050fc73e41e8c4b
Formatting: breaking long lines.

diff -r 2b9a43c0d64e -r 7a54630d22b6 src/test/minlengthpaths_test.cc
--- a/src/test/minlengthpaths_test.cc	Thu Sep 02 17:11:04 2004 +0000
+++ b/src/test/minlengthpaths_test.cc	Thu Sep 02 17:30:06 2004 +0000
@@ -58,9 +58,11 @@
   MinLengthPaths< ListGraph, ListGraph::EdgeMap<int> >
     surb_test(graph, length);
 
-  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46");
+  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,
+	  "Two paths, total length should be 46");
 
-  check(  surb_test.checkComplementarySlackness(), "Complementary slackness conditions are not met.");
+  check(  surb_test.checkComplementarySlackness(),
+	  "Complementary slackness conditions are not met.");
 
   //  typedef DirPath<ListGraph> DPath;
   //  DPath P(graph);
@@ -75,9 +77,11 @@
   */  
 
   k=1;
-  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,"One path, total length should be 19");
+  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,
+	  "One path, total length should be 19");
 
-  check(  surb_test.checkComplementarySlackness(), "Complementary slackness conditions are not met.");
+  check(  surb_test.checkComplementarySlackness(),
+	  "Complementary slackness conditions are not met.");
  
   //  surb_test.getPath(P,0);
   //  check(P.length() == 4, "First path should contain 4 edges.");