This class provides an iterator for obtaining the nodes of the given blossom. It lists a subset of the nodes. Before using this iterator, you must allocate a MaxWeightedPerfectMatching class and execute it.
#include <lemon/matching.h>
| Public Member Functions | |
| BlossomIt (const MaxWeightedPerfectMatching &algorithm, int variable) | |
| Constructor.  More... | |
| operator Node () const | |
| Conversion to Node.  More... | |
| BlossomIt & | operator++ () | 
| Increment operator.  More... | |
| bool | operator== (Invalid) const | 
| Validity checking.  More... | |
| bool | operator!= (Invalid) const | 
| Validity checking.  More... | |
| 
 | inline | 
Constructor to get the nodes of the given variable.
| 
 | inline | 
Conversion to Node. 
| 
 | inline | 
Increment operator.
| 
 | inline | 
This function checks whether the iterator is invalid.
| 
 | inline | 
This function checks whether the iterator is valid.
 1.8.5
 1.8.5