diff -r 8c14aa8f27a2 -r 7ceab500e1f6 lemon/suurballe.h
--- a/lemon/suurballe.h	Thu Jun 30 16:13:30 2005 +0000
+++ b/lemon/suurballe.h	Fri Jul 01 10:33:27 2005 +0000
@@ -39,7 +39,7 @@
   /// from a given source node to a given target node in an
   /// edge-weighted directed graph having minimal total weight (length).
   ///
-  ///\warning Length values should be nonnegative.
+  ///\warning Length values should be nonnegative!
   /// 
   ///\param Graph The directed graph type the algorithm runs on.
   ///\param LengthMap The type of the length map (values should be nonnegative).
@@ -121,7 +121,6 @@
 	reversed[e] = min_cost_flow.getFlow()[e];
       
       paths.clear();
-      //total_length=0;
       paths.resize(k);
       for (int j=0; j<i; ++j){
 	Node n=s;
@@ -135,7 +134,6 @@
 	  }
 	  n = G.target(e);
 	  paths[j].push_back(e);
-	  //total_length += length[e];
 	  reversed[e] = 1-reversed[e];
 	}
 	
@@ -166,7 +164,7 @@
 
     ///This function checks, whether the given solution is optimal.
     ///Currently this function only checks optimality,
-    ///doesn't bother with feasibility
+    ///doesn't bother with feasibility.
     ///It is meant for testing purposes.
     bool checkComplementarySlackness(){
       return min_cost_flow.checkComplementarySlackness();
@@ -175,15 +173,15 @@
     ///Read the found paths.
     
     ///This function gives back the \c j-th path in argument p.
-    ///Assumes that \c run() has been run and nothing changed since then.
+    ///Assumes that \c run() has been run and nothing has changed since then.
     /// \warning It is assumed that \c p is constructed to
     ///be a path of graph \c G.
     ///If \c j is not less than the result of previous \c run,
     ///then the result here will be an empty path (\c j can be 0 as well).
     ///
     ///\param Path The type of the path structure to put the result to (must meet lemon path concept).
-    ///\param p The path to put the result to 
-    ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively)
+    ///\param p The path to put the result to.
+    ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively).
     template<typename Path>
     void getPath(Path& p, size_t j){