ActiveIt Class Reference

---

Detailed Description

template<typename _Graph, typename _LengthMap, typename _Traits>
class lemon::BellmanFord< _Graph, _LengthMap, _Traits >::ActiveIt

Lemon iterator for get the active nodes. This class provides a common style lemon iterator which gives back a subset of the nodes. The iterated nodes are active in the algorithm after the last phase so these should be checked in the next phase to find augmenting edges from these. #include <lemon/bellman_ford.h>

List of all members.

Public Member Functions
	ActiveIt (const BellmanFord &algorithm)
	Constructor.
	ActiveIt (Invalid)
	operator Node () const
ActiveIt &	operator++ ()

---

Constructor & Destructor Documentation

ActiveIt

(

const BellmanFord &

algorithm

)

[inline]

Constructor for get the nodeset of the variable.

ActiveIt

(

Invalid

)

[inline]

Invalid constructor.

---

Member Function Documentation

operator Node

(

)

const [inline]

Conversion to node.

ActiveIt& operator++

(

)

[inline]

Increment operator.