This iterator class lists the nodes of a minimum cut found by GomoryHu. Before using it, you must allocate a GomoryHu class and call its run() method.
This example counts the nodes in the minimum cut separating s from t.
#include <lemon/gomory_hu.h>
Public Member Functions | |
| MinCutNodeIt (GomoryHu const &gomory, const Node &s, const Node &t, bool side=true) | |
| Constructor. More... | |
| operator typename Graph::Node () const | |
Conversion to Node. More... | |
| MinCutNodeIt & | operator++ () |
| Next node. More... | |
| Graph::Node | 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 iterator lists the nodes of the component containing s, otherwise it lists the other component. |
|
inline |
Conversion to Node.
|
inline |
Next node.
|
inline |
Postfix incrementation.
Node, not a MinCutNodeIt, as one may expect.
1.8.5