This iterator goes through each blue node of the graph. Its usage is quite simple, for example, you can count the number of blue nodes in a graph g of type BpGraph like this:
#include <lemon/concepts/bpgraph.h>
Inheritance diagram for BpGraph::BlueNodeIt:Public Member Functions | |
| BlueNodeIt () | |
| Default constructor. More... | |
| BlueNodeIt (const BlueNodeIt &n) | |
| Copy constructor. More... | |
| BlueNodeIt (Invalid) | |
| Invalid constructor & conversion. More... | |
| BlueNodeIt (const BpGraph &) | |
| Sets the iterator to the first blue node. More... | |
| BlueNodeIt (const BpGraph &, const BlueNode &) | |
| Sets the iterator to the given blue node. More... | |
| BlueNodeIt & | operator++ () |
| Next node. More... | |
Public Member Functions inherited from BpGraph::BlueNode | |
| BlueNode () | |
| Default constructor. More... | |
| BlueNode (const BlueNode &) | |
| Copy constructor. More... | |
| BlueNode (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.
|
inline |
Copy constructor.
|
inline |
Initializes the iterator to be invalid.
|
inlineexplicit |
Sets the iterator to the first blue node of the given digraph.
|
inline |
Sets the iterator to the given blue node of the given digraph.
|
inline |
Assign the iterator to the next blue node.
1.8.5