![]() |
abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
|
Iterator class for the red nodes. More...
#include <lemon/concepts/bpgraph.h>
Public Member Functions | |
| RedNodeIt () | |
| Default constructor. | |
| RedNodeIt (const RedNodeIt &n) | |
| Copy constructor. | |
| const RedNodeIt & | operator= (const RedNodeIt &) |
| Assignment operator. | |
| 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. | |
| Public Member Functions inherited from BpGraph::RedNode | |
| RedNode () | |
| Default constructor. | |
| RedNode (const RedNode &) | |
| Copy constructor. | |
| const RedNode & | operator= (const RedNode &) |
| Assignment operator. | |
| RedNode (Invalid) | |
| Invalid constructor & conversion. | |
| Public Member Functions inherited from BpGraph::Node | |
| Node () | |
| Default constructor. | |
| Node (const Node &) | |
| Copy constructor. | |
| const Node & | operator= (const Node &) |
| Assignment operator. | |
| Node (Invalid) | |
| Invalid constructor & conversion. | |
| bool | operator== (Node) const |
| Equality operator. | |
| bool | operator!= (Node) const |
| Inequality operator. | |
| bool | operator< (Node) const |
| Artificial ordering operator. | |
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:
|
inline |
Default constructor.
|
inline |
Copy constructor.
|
inline |
Initializes the iterator to be invalid.
|
inlineexplicit |
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.