abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
Loading...
Searching...
No Matches
MaxWeightedPerfectMatching< GR , WM >::BlossomIt Class Reference

Iterator for obtaining the nodes of a blossom. More...

#include <lemon/matching.h>

Public Member Functions

 BlossomIt (const MaxWeightedPerfectMatching &algorithm, int variable)
 Constructor.
 operator Node () const
 Conversion to Node.
BlossomIt & operator++ ()
 Increment operator.
bool operator== (Invalid) const
 Validity checking.
bool operator!= (Invalid) const
 Validity checking.

Detailed Description

template< typename GR , typename WM >
class lemon::MaxWeightedPerfectMatching< GR , WM >::BlossomIt

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.

Constructor & Destructor Documentation

◆ BlossomIt()

template< typename GR , typename WM >
BlossomIt ( const MaxWeightedPerfectMatching & algorithm,
int variable )
inline

Constructor to get the nodes of the given variable.

Precondition
Either algorithm.run() or algorithm.start() must be called before initializing this iterator.

Member Function Documentation

◆ operator Node()

template< typename GR , typename WM >
operator Node ( ) const
inline

Conversion to Node.

◆ operator++()

template< typename GR , typename WM >
BlossomIt & operator++ ( )
inline

Increment operator.

◆ operator==()

template< typename GR , typename WM >
bool operator== ( Invalid ) const
inline

This function checks whether the iterator is invalid.

◆ operator!=()

template< typename GR , typename WM >
bool operator!= ( Invalid ) const
inline

This function checks whether the iterator is valid.