diff -r 6a30e13a1c79 -r d9cfac072869 lemon/bellman_ford.h
--- a/lemon/bellman_ford.h	Tue Nov 20 15:06:03 2007 +0000
+++ b/lemon/bellman_ford.h	Tue Nov 20 21:40:55 2007 +0000
@@ -435,7 +435,7 @@
     /// after each iteration the \ref predMap() map and manually build
     /// the path.
     ///
-    /// \return %True when the algorithm have not found more shorter
+    /// \return \c true when the algorithm have not found more shorter
     /// paths.
     bool processNextRound() {
       for (int i = 0; i < int(_process.size()); ++i) {
@@ -472,7 +472,7 @@
     /// 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.
-    /// \return %True when the algorithm have not found more shorter paths.
+    /// \return \c true when the algorithm have not found more shorter paths.
     bool processNextWeakRound() {
       for (int i = 0; i < int(_process.size()); ++i) {
 	_mask->set(_process[i], false);
@@ -517,14 +517,15 @@
     /// \brief Executes the algorithm and checks the negative cycles.
     ///
     /// \pre init() must be called and at least one node should be added
-    /// with addSource() before using this function. If there is
-    /// a negative cycle in the graph it gives back false.
+    /// with addSource() before using this function. 
     ///
     /// This method runs the %BellmanFord algorithm from the root node(s)
     /// in order to compute the shortest path to each node. The algorithm 
     /// computes 
     /// - The shortest path tree.
     /// - The distance of each node from the root(s).
+    /// 
+    /// \return \c false if there is a negative cycle in the graph.
     bool checkedStart() {
       int num = countNodes(*graph);
       for (int i = 0; i < num; ++i) {