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