diff -r f63ba40a60f4 -r 16f55008c863 lemon/cost_scaling.h
--- a/lemon/cost_scaling.h	Mon Jan 30 23:24:14 2012 +0100
+++ b/lemon/cost_scaling.h	Mon Jan 30 23:24:40 2012 +0100
@@ -98,7 +98,8 @@
   /// "preflow push-relabel" algorithm for the maximum flow problem.
   ///
   /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest
-  /// implementations available in LEMON for this problem.
+  /// implementations available in LEMON for solving this problem.
+  /// (For more information, see \ref min_cost_flow_algs "the module page".)
   ///
   /// Most of the parameters of the problem (except for the digraph)
   /// can be given using separate functions, and the algorithm can be
@@ -704,7 +705,8 @@
       return _res_cap[_arc_idb[a]];
     }
 
-    /// \brief Return the flow map (the primal solution).
+    /// \brief Copy the flow values (the primal solution) into the
+    /// given map.
     ///
     /// This function copies the flow value on each arc into the given
     /// map. The \c Value type of the algorithm must be convertible to
@@ -728,7 +730,8 @@
       return static_cast<Cost>(_pi[_node_id[n]]);
     }
 
-    /// \brief Return the potential map (the dual solution).
+    /// \brief Copy the potential values (the dual solution) into the
+    /// given map.
     ///
     /// This function copies the potential (dual value) of each node
     /// into the given map.