Index: lemon/belmann_ford.h
===================================================================
--- lemon/belmann_ford.h (revision 1783)
+++ lemon/belmann_ford.h (revision 1816)
@@ -420,7 +420,8 @@
///
/// 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) {
@@ -453,8 +454,10 @@
///
/// 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) {
@@ -524,5 +527,5 @@
/// 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).