MinCostArborescence::DualIt Class Reference

#include <lemon/min_cost_arborescence.h>

List of all members.


Detailed Description

template<typename _Graph, typename _CostMap, typedef _Traits>
class lemon::MinCostArborescence< _Graph, _CostMap, _Traits >::DualIt

Lemon iterator for get a dual variable. This class provides a common style lemon iterator which gives back a subset of the nodes.


Public Member Functions

 DualIt (const MinCostArborescence &algorithm, int variable)
 Constructor.
 DualIt (Invalid)
 Invalid constructor.
 operator Node () const
 Conversion to node.
DualItoperator++ ()
 Increment operator.


Constructor & Destructor Documentation

DualIt ( const MinCostArborescence algorithm,
int  variable 
) [inline]

Constructor for get the nodeset of the variable.

DualIt ( Invalid   )  [inline]

Invalid constructor.


Member Function Documentation

operator Node (  )  const [inline]

Conversion to node.

DualIt& operator++ (  )  [inline]

Increment operator.


The documentation for this class was generated from the following file:
Generated on Tue Oct 31 09:51:12 2006 for LEMON by  doxygen 1.5.1