1.1 --- a/lemon/capacity_scaling.h Thu Sep 13 12:23:46 2012 +0200
1.2 +++ b/lemon/capacity_scaling.h Wed Nov 07 17:39:39 2012 +0100
1.3 @@ -70,6 +70,11 @@
1.4 /// \ref edmondskarp72theoretical. It is an efficient dual
1.5 /// solution method.
1.6 ///
1.7 + /// This algorithm is typically slower than \ref CostScaling and
1.8 + /// \ref NetworkSimplex, but in special cases, it can be more
1.9 + /// efficient than them.
1.10 + /// (For more information, see \ref min_cost_flow_algs "the module page".)
1.11 + ///
1.12 /// Most of the parameters of the problem (except for the digraph)
1.13 /// can be given using separate functions, and the algorithm can be
1.14 /// executed using the \ref run() function. If some parameters are not
1.15 @@ -676,7 +681,8 @@
1.16 return _res_cap[_arc_idb[a]];
1.17 }
1.18
1.19 - /// \brief Return the flow map (the primal solution).
1.20 + /// \brief Copy the flow values (the primal solution) into the
1.21 + /// given map.
1.22 ///
1.23 /// This function copies the flow value on each arc into the given
1.24 /// map. The \c Value type of the algorithm must be convertible to
1.25 @@ -700,7 +706,8 @@
1.26 return _pi[_node_id[n]];
1.27 }
1.28
1.29 - /// \brief Return the potential map (the dual solution).
1.30 + /// \brief Copy the potential values (the dual solution) into the
1.31 + /// given map.
1.32 ///
1.33 /// This function copies the potential (dual value) of each node
1.34 /// into the given map.