This class provides a common style LEMON iterator for getting a dual variable of MinCostArborescence algorithm. It iterates over a subset of the nodes.
#include <lemon/min_cost_arborescence.h>
| Public Member Functions | |
| DualIt (const MinCostArborescence &algorithm, int variable) | |
| Constructor.  More... | |
| operator Node () const | |
| Conversion to Node.  More... | |
| DualIt & | operator++ () | 
| Increment operator.  More... | |
| bool | operator== (Invalid) const | 
| Validity checking.  More... | |
| bool | operator!= (Invalid) const | 
| Validity checking.  More... | |
| 
 | inline | 
Constructor for getting the nodeset of the dual variable of MinCostArborescence algorithm.
| 
 | inline | 
Conversion to Node. 
| 
 | inline | 
Increment operator.
| 
 | inline | 
Checks whether the iterator is invalid.
| 
 | inline | 
Checks whether the iterator is valid.
 1.8.5
 1.8.5