1.1 --- a/lemon/belmann_ford.h	Wed Nov 02 15:26:04 2005 +0000
     1.2 +++ b/lemon/belmann_ford.h	Wed Nov 02 15:27:38 2005 +0000
     1.3 @@ -141,7 +141,7 @@
     1.4  
     1.5    };
     1.6    
     1.7 -  /// \brief BelmannFord algorithm class.
     1.8 +  /// \brief %BelmannFord algorithm class.
     1.9    ///
    1.10    /// \ingroup flowalgs
    1.11    /// This class provides an efficient implementation of \c Belmann-Ford 
    1.12 @@ -151,7 +151,7 @@
    1.13    ///
    1.14    /// The Belmann-Ford algorithm solves the shortest path from one node
    1.15    /// problem when the edges can have negative length but the graph should
    1.16 -  /// not contain circle with negative sum of length. If we can assume
    1.17 +  /// not contain cycles with negative sum of length. If we can assume
    1.18    /// that all edge is non-negative in the graph then the dijkstra algorithm
    1.19    /// should be used rather.
    1.20    ///
    1.21 @@ -428,11 +428,11 @@
    1.22        }
    1.23      }
    1.24  
    1.25 -    /// \brief Executes the algorithm and checks the negative circles.
    1.26 +    /// \brief Executes the algorithm and checks the negative cycles.
    1.27      ///
    1.28      /// \pre init() must be called and at least one node should be added
    1.29      /// with addSource() before using this function. If there is
    1.30 -    /// a negative circle in the graph it gives back false.
    1.31 +    /// a negative cycles in the graph it gives back false.
    1.32      ///
    1.33      /// This method runs the %BelmannFord algorithm from the root node(s)
    1.34      /// in order to compute the shortest path to each node. The algorithm