This iterator goes through each red node of the graph. Its usage is quite simple, for example, you can count the number of red nodes in a graph g
of type BpGraph
like this:
#include <lemon/concepts/bpgraph.h>
Public Member Functions | |
RedNodeIt () | |
Default constructor. More... | |
RedNodeIt (const RedNodeIt &n) | |
Copy constructor. More... | |
RedNodeIt (Invalid) | |
Invalid constructor & conversion. More... | |
RedNodeIt (const BpGraph &) | |
Sets the iterator to the first red node. More... | |
RedNodeIt (const BpGraph &, const RedNode &) | |
Sets the iterator to the given red node. More... | |
RedNodeIt & | operator++ () |
Next node. More... | |
Public Member Functions inherited from BpGraph::RedNode | |
RedNode () | |
Default constructor. More... | |
RedNode (const RedNode &) | |
Copy constructor. More... | |
RedNode (Invalid) | |
Invalid constructor & conversion. More... | |
Public Member Functions inherited from BpGraph::Node | |
Node () | |
Default constructor. More... | |
Node (const Node &) | |
Copy constructor. More... | |
Node (Invalid) | |
Invalid constructor & conversion. More... | |
bool | operator== (Node) const |
Equality operator. More... | |
bool | operator!= (Node) const |
Inequality operator. More... | |
bool | operator< (Node) const |
Artificial ordering operator. More... | |
|
inline |
Default constructor.
Initializes the iterator to be invalid.
Sets the iterator to the first red node of the given digraph.
Sets the iterator to the given red node of the given digraph.
|
inline |
Assign the iterator to the next red node.