1.1 --- a/lemon/belmann_ford.h	Fri Nov 18 11:10:53 2005 +0000
     1.2 +++ b/lemon/belmann_ford.h	Fri Nov 18 11:13:11 2005 +0000
     1.3 @@ -419,9 +419,10 @@
     1.4      /// \brief Executes one round from the belmann ford algorithm.
     1.5      ///
     1.6      /// If the algoritm calculated the distances in the previous round 
     1.7 -    /// strictly for all at most k length pathes then it will calculate the 
     1.8 -    /// distances strictly for all at most k + 1 length pathes. With k
     1.9 -    /// iteration this function calculates the at most k length pathes. 
    1.10 +    /// strictly for all at most k length paths then it will calculate the 
    1.11 +    /// distances strictly for all at most k + 1 length paths. With k
    1.12 +    /// iteration this function calculates the at most k length paths.
    1.13 +    ///\todo what is the return value?
    1.14      bool processNextRound() {
    1.15        for (int i = 0; i < (int)_process.size(); ++i) {
    1.16  	_mask->set(_process[i], false);
    1.17 @@ -452,10 +453,12 @@
    1.18      /// \brief Executes one weak round from the belmann ford algorithm.
    1.19      ///
    1.20      /// If the algorithm calculated the distances in the
    1.21 -    /// previous round at least for all at most k length pathes then it will
    1.22 -    /// calculate the distances at least for all at most k + 1 length pathes.
    1.23 -    /// This function does not make possible to calculate strictly the
    1.24 -    /// at most k length minimal pathes, this way it called just weak round.
    1.25 +    /// previous round at least for all at most k length paths then it will
    1.26 +    /// calculate the distances at least for all at most k + 1 length paths.
    1.27 +    /// This function does not make it possible to calculate strictly the
    1.28 +    /// at most k length minimal paths, this is why it is
    1.29 +    /// called just weak round.
    1.30 +    ///\todo what is the return value?
    1.31      bool processNextWeakRound() {
    1.32        for (int i = 0; i < (int)_process.size(); ++i) {
    1.33  	_mask->set(_process[i], false);
    1.34 @@ -523,7 +526,7 @@
    1.35      ///
    1.36      /// This method runs the %BelmannFord algorithm from the root node(s)
    1.37      /// in order to compute the shortest path with at most \c length edge 
    1.38 -    /// long pathes to each node. The algorithm computes 
    1.39 +    /// long paths to each node. The algorithm computes 
    1.40      /// - The shortest path tree.
    1.41      /// - The limited distance of each node from the root(s).
    1.42      void limitedStart(int length) {