This iterator class lists the edges of a minimum cut found by GomoryHu. Before using it, you must allocate a GomoryHu class and call its run() method.
This example computes the value of the minimum cut separating s from t.
The result will be the same as the value returned by gom.minCutValue(s,t).
#include <lemon/gomory_hu.h>
Public Member Functions | |
| MinCutEdgeIt (GomoryHu const &gomory, const Node &s, const Node &t, bool side=true) | |
| Constructor. More... | |
| operator typename Graph::Arc () const | |
Conversion to Arc. More... | |
| operator typename Graph::Edge () const | |
Conversion to Edge. More... | |
| MinCutEdgeIt & | operator++ () |
| Next edge. More... | |
| Graph::Arc | operator++ (int) |
| Postfix incrementation. More... | |
|
inline |
Constructor.
| gomory | The GomoryHu class. You must call its run() method before initializing this iterator. |
| s | The base node. |
| t | The node you want to separate from node s. |
| side | If it is true (default) then the listed arcs will be oriented from the nodes of the component containing s, otherwise they will be oriented in the opposite direction. |
|
inline |
Conversion to Arc.
|
inline |
Conversion to Edge.
|
inline |
Next edge.
|
inline |
Postfix incrementation.
Arc, not a MinCutEdgeIt, as one may expect.
1.8.5