# HG changeset patch
# User alpar
# Date 1132312391 0
# Node ID 19ee9133a28ca25f3f0b3bc8e5c5204692b436d0
# Parent  611fa45a5ca9c91e32c4c72bc785a616d37198d9
- Spellcheck (pathes->paths)
- todos

diff -r 611fa45a5ca9 -r 19ee9133a28c lemon/belmann_ford.h
--- a/lemon/belmann_ford.h	Fri Nov 18 11:10:53 2005 +0000
+++ b/lemon/belmann_ford.h	Fri Nov 18 11:13:11 2005 +0000
@@ -419,9 +419,10 @@
     /// \brief Executes one round from the belmann ford algorithm.
     ///
     /// If the algoritm calculated the distances in the previous round 
-    /// strictly for all at most k length pathes then it will calculate the 
-    /// distances strictly for all at most k + 1 length pathes. With k
-    /// iteration this function calculates the at most k length pathes. 
+    /// strictly for all at most k length paths then it will calculate the 
+    /// distances strictly for all at most k + 1 length paths. With k
+    /// iteration this function calculates the at most k length paths.
+    ///\todo what is the return value?
     bool processNextRound() {
       for (int i = 0; i < (int)_process.size(); ++i) {
 	_mask->set(_process[i], false);
@@ -452,10 +453,12 @@
     /// \brief Executes one weak round from the belmann ford algorithm.
     ///
     /// If the algorithm calculated the distances in the
-    /// previous round at least for all at most k length pathes then it will
-    /// calculate the distances at least for all at most k + 1 length pathes.
-    /// This function does not make possible to calculate strictly the
-    /// at most k length minimal pathes, this way it called just weak round.
+    /// previous round at least for all at most k length paths then it will
+    /// calculate the distances at least for all at most k + 1 length paths.
+    /// This function does not make it possible to calculate strictly the
+    /// at most k length minimal paths, this is why it is
+    /// called just weak round.
+    ///\todo what is the return value?
     bool processNextWeakRound() {
       for (int i = 0; i < (int)_process.size(); ++i) {
 	_mask->set(_process[i], false);
@@ -523,7 +526,7 @@
     ///
     /// This method runs the %BelmannFord algorithm from the root node(s)
     /// in order to compute the shortest path with at most \c length edge 
-    /// long pathes to each node. The algorithm computes 
+    /// long paths to each node. The algorithm computes 
     /// - The shortest path tree.
     /// - The limited distance of each node from the root(s).
     void limitedStart(int length) {