1.1 --- a/lemon/cost_scaling.h Mon Jan 30 23:24:14 2012 +0100
1.2 +++ b/lemon/cost_scaling.h Mon Jan 30 23:24:40 2012 +0100
1.3 @@ -98,7 +98,8 @@
1.4 /// "preflow push-relabel" algorithm for the maximum flow problem.
1.5 ///
1.6 /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest
1.7 - /// implementations available in LEMON for this problem.
1.8 + /// implementations available in LEMON for solving this problem.
1.9 + /// (For more information, see \ref min_cost_flow_algs "the module page".)
1.10 ///
1.11 /// Most of the parameters of the problem (except for the digraph)
1.12 /// can be given using separate functions, and the algorithm can be
1.13 @@ -704,7 +705,8 @@
1.14 return _res_cap[_arc_idb[a]];
1.15 }
1.16
1.17 - /// \brief Return the flow map (the primal solution).
1.18 + /// \brief Copy the flow values (the primal solution) into the
1.19 + /// given map.
1.20 ///
1.21 /// This function copies the flow value on each arc into the given
1.22 /// map. The \c Value type of the algorithm must be convertible to
1.23 @@ -728,7 +730,8 @@
1.24 return static_cast<Cost>(_pi[_node_id[n]]);
1.25 }
1.26
1.27 - /// \brief Return the potential map (the dual solution).
1.28 + /// \brief Copy the potential values (the dual solution) into the
1.29 + /// given map.
1.30 ///
1.31 /// This function copies the potential (dual value) of each node
1.32 /// into the given map.