This class provides a common style LEMON iterator that traverses the active nodes of the Bellman-Ford algorithm after the last phase. These nodes should be checked in the next phase to find augmenting arcs outgoing from them.
#include <lemon/bellman_ford.h>
Public Member Functions | |
| ActiveIt (const BellmanFord &algorithm) | |
| Constructor. More... | |
| ActiveIt (Invalid) | |
| Invalid constructor. More... | |
| operator Node () const | |
Conversion to Node. More... | |
| ActiveIt & | operator++ () |
| Increment operator. More... | |
|
inline |
Constructor for getting the active nodes of the given BellmanFord instance.
|
inline |
Conversion to Node.
|
inline |
Increment operator.
1.8.5