1.1 --- a/lemon/suurballe.h	Thu Jun 30 16:13:30 2005 +0000
     1.2 +++ b/lemon/suurballe.h	Fri Jul 01 10:33:27 2005 +0000
     1.3 @@ -39,7 +39,7 @@
     1.4    /// from a given source node to a given target node in an
     1.5    /// edge-weighted directed graph having minimal total weight (length).
     1.6    ///
     1.7 -  ///\warning Length values should be nonnegative.
     1.8 +  ///\warning Length values should be nonnegative!
     1.9    /// 
    1.10    ///\param Graph The directed graph type the algorithm runs on.
    1.11    ///\param LengthMap The type of the length map (values should be nonnegative).
    1.12 @@ -121,7 +121,6 @@
    1.13  	reversed[e] = min_cost_flow.getFlow()[e];
    1.14        
    1.15        paths.clear();
    1.16 -      //total_length=0;
    1.17        paths.resize(k);
    1.18        for (int j=0; j<i; ++j){
    1.19  	Node n=s;
    1.20 @@ -135,7 +134,6 @@
    1.21  	  }
    1.22  	  n = G.target(e);
    1.23  	  paths[j].push_back(e);
    1.24 -	  //total_length += length[e];
    1.25  	  reversed[e] = 1-reversed[e];
    1.26  	}
    1.27  	
    1.28 @@ -166,7 +164,7 @@
    1.29  
    1.30      ///This function checks, whether the given solution is optimal.
    1.31      ///Currently this function only checks optimality,
    1.32 -    ///doesn't bother with feasibility
    1.33 +    ///doesn't bother with feasibility.
    1.34      ///It is meant for testing purposes.
    1.35      bool checkComplementarySlackness(){
    1.36        return min_cost_flow.checkComplementarySlackness();
    1.37 @@ -175,15 +173,15 @@
    1.38      ///Read the found paths.
    1.39      
    1.40      ///This function gives back the \c j-th path in argument p.
    1.41 -    ///Assumes that \c run() has been run and nothing changed since then.
    1.42 +    ///Assumes that \c run() has been run and nothing has changed since then.
    1.43      /// \warning It is assumed that \c p is constructed to
    1.44      ///be a path of graph \c G.
    1.45      ///If \c j is not less than the result of previous \c run,
    1.46      ///then the result here will be an empty path (\c j can be 0 as well).
    1.47      ///
    1.48      ///\param Path The type of the path structure to put the result to (must meet lemon path concept).
    1.49 -    ///\param p The path to put the result to 
    1.50 -    ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively)
    1.51 +    ///\param p The path to put the result to.
    1.52 +    ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively).
    1.53      template<typename Path>
    1.54      void getPath(Path& p, size_t j){
    1.55