diff -r fb2052c94ebd -r 467ca6d16556 lemon/bellman_ford.h
--- a/lemon/bellman_ford.h	Tue Mar 13 15:35:56 2007 +0000
+++ b/lemon/bellman_ford.h	Tue Mar 13 15:42:06 2007 +0000
@@ -38,7 +38,7 @@
   /// \brief Default OperationTraits for the BellmanFord algorithm class.
   ///  
   /// It defines all computational operations and constants which are
-  /// used in the bellman ford algorithm. The default implementation
+  /// used in the Bellman-Ford algorithm. The default implementation
   /// is based on the numeric_limits class. If the numeric type does not
   /// have infinity value then the maximum value is used as extremal
   /// infinity value.
@@ -100,7 +100,7 @@
     // The type of the length of the edges.
     typedef typename _LengthMap::Value Value;
 
-    /// \brief Operation traits for bellman-ford algorithm.
+    /// \brief Operation traits for Bellman-Ford algorithm.
     ///
     /// It defines the infinity type on the given Value type
     /// and the used operation.
@@ -410,8 +410,9 @@
     
     /// \brief Adds a new source node.
     ///
-    /// The optional second parameter is the initial distance of the node.
-    /// It just sets the distance of the node to the given value.
+    /// Adds a new source node. The optional second parameter is the 
+    /// initial distance of the node. It just sets the distance of the 
+    /// node to the given value.
     void addSource(Node source, Value dst = OperationTraits::zero()) {
       _dist->set(source, dst);
       if (!(*_mask)[source]) {
@@ -420,7 +421,7 @@
       }
     }
 
-    /// \brief Executes one round from the bellman ford algorithm.
+    /// \brief Executes one round from the Bellman-Ford algorithm.
     ///
     /// If the algoritm calculated the distances in the previous round
     /// exactly for all at most \f$ k \f$ length path lengths then it will
@@ -463,7 +464,7 @@
       return _process.empty();
     }
 
-    /// \brief Executes one weak round from the bellman ford algorithm.
+    /// \brief Executes one weak round from the Bellman-Ford algorithm.
     ///
     /// If the algorithm calculated the distances in the
     /// previous round at least for all at most k length paths then it will
@@ -517,7 +518,7 @@
     ///
     /// \pre init() must be called and at least one node should be added
     /// with addSource() before using this function. If there is
-    /// a negative cycles in the graph it gives back false.
+    /// a negative cycle in the graph it gives back false.
     ///
     /// This method runs the %BellmanFord algorithm from the root node(s)
     /// in order to compute the shortest path to each node. The algorithm 
@@ -607,7 +608,7 @@
     
     ///@{
 
-    /// \brief Lemon iterator for get a active nodes.
+    /// \brief Lemon iterator for get the active nodes.
     ///
     /// Lemon iterator for get the active nodes. This class provides a
     /// common style lemon iterator which gives back a subset of the
@@ -784,7 +785,7 @@
     /// \brief The value type of the length map.
     typedef typename _LengthMap::Value Value;
 
-    /// \brief Operation traits for bellman-ford algorithm.
+    /// \brief Operation traits for Bellman-Ford algorithm.
     ///
     /// It defines the infinity type on the given Value type
     /// and the used operation.