diff -r 30fb4d68b0e8 -r 8f41a3129746 lemon/cycle_canceling.h
--- a/lemon/cycle_canceling.h	Sun Oct 05 13:36:43 2008 +0000
+++ b/lemon/cycle_canceling.h	Sun Oct 05 13:37:17 2008 +0000
@@ -64,7 +64,6 @@
   /// parameter.
   ///
   /// \author Peter Kovacs
-
   template < typename Graph,
              typename LowerMap = typename Graph::template EdgeMap<int>,
              typename CapacityMap = typename Graph::template EdgeMap<int>,
@@ -98,8 +97,7 @@
 
     /// \brief Map adaptor class for handling residual edge costs.
     ///
-    /// \ref ResidualCostMap is a map adaptor class for handling
-    /// residual edge costs.
+    /// Map adaptor class for handling residual edge costs.
     class ResidualCostMap : public MapBase<ResEdge, Cost>
     {
     private:
@@ -278,9 +276,9 @@
       delete _res_graph;
     }
 
-    /// \brief Sets the flow map.
+    /// \brief Set the flow map.
     ///
-    /// Sets the flow map.
+    /// Set the flow map.
     ///
     /// \return \c (*this)
     CycleCanceling& flowMap(FlowMap &map) {
@@ -292,9 +290,9 @@
       return *this;
     }
 
-    /// \brief Sets the potential map.
+    /// \brief Set the potential map.
     ///
-    /// Sets the potential map.
+    /// Set the potential map.
     ///
     /// \return \c (*this)
     CycleCanceling& potentialMap(PotentialMap &map) {
@@ -307,14 +305,12 @@
     }
 
     /// \name Execution control
-    /// The only way to execute the algorithm is to call the run()
-    /// function.
 
     /// @{
 
-    /// \brief Runs the algorithm.
+    /// \brief Run the algorithm.
     ///
-    /// Runs the algorithm.
+    /// Run the algorithm.
     ///
     /// \param min_mean_cc Set this parameter to \c true to run the
     /// "Minimum Mean Cycle-Canceling" algorithm, which is strongly
@@ -329,25 +325,26 @@
 
     /// \name Query Functions
     /// The result of the algorithm can be obtained using these
-    /// functions.
-    /// \n run() must be called before using them.
+    /// functions.\n
+    /// \ref lemon::CycleCanceling::run() "run()" must be called before
+    /// using them.
 
     /// @{
 
-    /// \brief Returns a const reference to the edge map storing the
+    /// \brief Return a const reference to the edge map storing the
     /// found flow.
     ///
-    /// Returns a const reference to the edge map storing the found flow.
+    /// Return a const reference to the edge map storing the found flow.
     ///
     /// \pre \ref run() must be called before using this function.
     const FlowMap& flowMap() const {
       return *_flow;
     }
 
-    /// \brief Returns a const reference to the node map storing the
+    /// \brief Return a const reference to the node map storing the
     /// found potentials (the dual solution).
     ///
-    /// Returns a const reference to the node map storing the found
+    /// Return a const reference to the node map storing the found
     /// potentials (the dual solution).
     ///
     /// \pre \ref run() must be called before using this function.
@@ -355,27 +352,27 @@
       return *_potential;
     }
 
-    /// \brief Returns the flow on the given edge.
+    /// \brief Return the flow on the given edge.
     ///
-    /// Returns the flow on the given edge.
+    /// Return the flow on the given edge.
     ///
     /// \pre \ref run() must be called before using this function.
     Capacity flow(const Edge& edge) const {
       return (*_flow)[edge];
     }
 
-    /// \brief Returns the potential of the given node.
+    /// \brief Return the potential of the given node.
     ///
-    /// Returns the potential of the given node.
+    /// Return the potential of the given node.
     ///
     /// \pre \ref run() must be called before using this function.
     Cost potential(const Node& node) const {
       return (*_potential)[node];
     }
 
-    /// \brief Returns the total cost of the found flow.
+    /// \brief Return the total cost of the found flow.
     ///
-    /// Returns the total cost of the found flow. The complexity of the
+    /// Return the total cost of the found flow. The complexity of the
     /// function is \f$ O(e) \f$.
     ///
     /// \pre \ref run() must be called before using this function.
@@ -390,7 +387,7 @@
 
   private:
 
-    /// Initializes the algorithm.
+    /// Initialize the algorithm.
     bool init() {
       if (!_valid_supply) return false;
 
@@ -428,9 +425,9 @@
       return true;
     }
 
-    /// \brief Executes the algorithm using \ref BellmanFord.
+    /// \brief Execute the algorithm using \ref BellmanFord.
     ///
-    /// Executes the algorithm using the \ref BellmanFord
+    /// Execute the algorithm using the \ref BellmanFord
     /// "Bellman-Ford" algorithm for negative cycle detection with
     /// successively larger limit for the number of iterations.
     void start() {
@@ -506,9 +503,9 @@
       }
     }
 
-    /// \brief Executes the algorithm using \ref MinMeanCycle.
+    /// \brief Execute the algorithm using \ref MinMeanCycle.
     ///
-    /// Executes the algorithm using \ref MinMeanCycle for negative
+    /// Execute the algorithm using \ref MinMeanCycle for negative
     /// cycle detection.
     void startMinMean() {
       typedef Path<ResGraph> ResPath;