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. | |
NodeIt (const NodeIt &n) | |
NodeIt (Invalid) | |
Invalid constructor & conversion. | |
NodeIt (const Digraph &) | |
Sets the iterator to the first node. | |
NodeIt (const Digraph &, const Node &) | |
Sets the iterator to the given node. | |
NodeIt & | operator++ () |
Next node. | |
![]() | |
Node () | |
Default constructor. | |
Node (const Node &) | |
Node (Invalid) | |
Invalid constructor & conversion. | |
bool | operator== (Node) const |
Equality operator. | |
bool | operator!= (Node) const |
bool | operator< (Node) const |
Artificial ordering operator. | |
|
inline |
Default constructor.
Sets the iterator to the given node of the given digraph.
|
inline |
Assign the iterator to the next node.