equal
deleted
inserted
replaced
292 /// |
292 /// |
293 /// \return The value of the minimum cut between \c s and \c t. |
293 /// \return The value of the minimum cut between \c s and \c t. |
294 /// |
294 /// |
295 /// \pre \ref run() must be called before using this function. |
295 /// \pre \ref run() must be called before using this function. |
296 template <typename CutMap> |
296 template <typename CutMap> |
297 Value minCutMap(const Node& s, ///< |
297 Value minCutMap(const Node& s, |
298 const Node& t, |
298 const Node& t, |
299 ///< |
|
300 CutMap& cutMap |
299 CutMap& cutMap |
301 ///< |
|
302 ) const { |
300 ) const { |
303 Node sn = s, tn = t; |
301 Node sn = s, tn = t; |
304 bool s_root=false; |
302 bool s_root=false; |
305 Node rn = INVALID; |
303 Node rn = INVALID; |
306 Value value = std::numeric_limits<Value>::max(); |
304 Value value = std::numeric_limits<Value>::max(); |
392 /// and |
390 /// and |
393 /// \code |
391 /// \code |
394 /// MinCutNodeIt(gomory, t, s, false); |
392 /// MinCutNodeIt(gomory, t, s, false); |
395 /// \endcode |
393 /// \endcode |
396 /// does not necessarily give the same set of nodes. |
394 /// does not necessarily give the same set of nodes. |
397 /// However it is ensured that |
395 /// However, it is ensured that |
398 /// \code |
396 /// \code |
399 /// MinCutNodeIt(gomory, s, t, true); |
397 /// MinCutNodeIt(gomory, s, t, true); |
400 /// \endcode |
398 /// \endcode |
401 /// and |
399 /// and |
402 /// \code |
400 /// \code |