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:
int count=0; for (BpGraph::RedNodeIt n(g); n!=INVALID; ++n) ++count;
#include <lemon/concepts/bpgraph.h>
Public Member Functions | |
RedNodeIt () | |
Default constructor. | |
RedNodeIt (const RedNodeIt &n) | |
RedNodeIt (Invalid) | |
Invalid constructor & conversion. | |
RedNodeIt (const BpGraph &) | |
Sets the iterator to the first red node. | |
RedNodeIt (const BpGraph &, const RedNode &) | |
Sets the iterator to the given red node. | |
RedNodeIt & | operator++ () |
Next node. |
RedNodeIt | ( | ) | [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.
RedNodeIt& operator++ | ( | ) | [inline] |
Assign the iterator to the next red node.