diff -r e344f0887c59 -r d59484d5fc1f lemon/network_simplex.h
--- a/lemon/network_simplex.h	Thu Sep 13 12:23:46 2012 +0200
+++ b/lemon/network_simplex.h	Wed Nov 07 17:39:39 2012 +0100
@@ -48,7 +48,8 @@
   /// 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".)
   /// Furthermore, this class supports both directions of the supply/demand
   /// inequality constraints. For more information, see \ref SupplyType.
   ///
@@ -1009,7 +1010,8 @@
       return _flow[_arc_id[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
@@ -1033,7 +1035,8 @@
       return _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.