Changes in lemon/gomory_hu.h [596:293551ad254f:786:e20173729589] in lemon-1.2
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/gomory_hu.h
r596 r786 295 295 /// \pre \ref run() must be called before using this function. 296 296 template <typename CutMap> 297 Value minCutMap(const Node& s, ///<297 Value minCutMap(const Node& s, 298 298 const Node& t, 299 ///<300 299 CutMap& cutMap 301 ///<302 300 ) const { 303 301 Node sn = s, tn = t; … … 360 358 /// \c t. 361 359 /// \code 362 /// Gomor uHu<Graph> gom(g, capacities);360 /// GomoryHu<Graph> gom(g, capacities); 363 361 /// gom.run(); 364 362 /// int cnt=0; 365 /// for(Gomor uHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt;363 /// for(GomoryHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt; 366 364 /// \endcode 367 365 class MinCutNodeIt … … 395 393 /// \endcode 396 394 /// does not necessarily give the same set of nodes. 397 /// However it is ensured that395 /// However, it is ensured that 398 396 /// \code 399 397 /// MinCutNodeIt(gomory, s, t, true); … … 457 455 /// \c t. 458 456 /// \code 459 /// Gomor uHu<Graph> gom(g, capacities);457 /// GomoryHu<Graph> gom(g, capacities); 460 458 /// gom.run(); 461 459 /// int value=0; 462 /// for(Gomor uHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e)460 /// for(GomoryHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e) 463 461 /// value+=capacities[e]; 464 462 /// \endcode
Note: See TracChangeset
for help on using the changeset viewer.