equal
deleted
inserted
replaced
357 /// and call its \ref GomoryHu::run() "run()" method. |
357 /// and call its \ref GomoryHu::run() "run()" method. |
358 /// |
358 /// |
359 /// This example counts the nodes in the minimum cut separating \c s from |
359 /// This example counts the nodes in the minimum cut separating \c s from |
360 /// \c t. |
360 /// \c t. |
361 /// \code |
361 /// \code |
362 /// GomoruHu<Graph> gom(g, capacities); |
362 /// GomoryHu<Graph> gom(g, capacities); |
363 /// gom.run(); |
363 /// gom.run(); |
364 /// int cnt=0; |
364 /// int cnt=0; |
365 /// for(GomoruHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt; |
365 /// for(GomoryHu<Graph>::MinCutNodeIt n(gom,s,t); n!=INVALID; ++n) ++cnt; |
366 /// \endcode |
366 /// \endcode |
367 class MinCutNodeIt |
367 class MinCutNodeIt |
368 { |
368 { |
369 bool _side; |
369 bool _side; |
370 typename Graph::NodeIt _node_it; |
370 typename Graph::NodeIt _node_it; |
454 /// and call its \ref GomoryHu::run() "run()" method. |
454 /// and call its \ref GomoryHu::run() "run()" method. |
455 /// |
455 /// |
456 /// This example computes the value of the minimum cut separating \c s from |
456 /// This example computes the value of the minimum cut separating \c s from |
457 /// \c t. |
457 /// \c t. |
458 /// \code |
458 /// \code |
459 /// GomoruHu<Graph> gom(g, capacities); |
459 /// GomoryHu<Graph> gom(g, capacities); |
460 /// gom.run(); |
460 /// gom.run(); |
461 /// int value=0; |
461 /// int value=0; |
462 /// for(GomoruHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e) |
462 /// for(GomoryHu<Graph>::MinCutEdgeIt e(gom,s,t); e!=INVALID; ++e) |
463 /// value+=capacities[e]; |
463 /// value+=capacities[e]; |
464 /// \endcode |
464 /// \endcode |
465 /// The result will be the same as the value returned by |
465 /// The result will be the same as the value returned by |
466 /// \ref GomoryHu::minCutValue() "gom.minCutValue(s,t)". |
466 /// \ref GomoryHu::minCutValue() "gom.minCutValue(s,t)". |
467 class MinCutEdgeIt |
467 class MinCutEdgeIt |