This iterator goes through each node. Its usage is quite simple, for example you can count the number of nodes in graph g
of type Graph
like this:
int count=0; for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
#include <lemon/concepts/graph.h>
Public Member Functions | |
NodeIt () | |
Default constructor. | |
NodeIt (const NodeIt &n) | |
NodeIt (Invalid) | |
Invalid constructor & conversion. | |
NodeIt (const Graph &) | |
Sets the iterator to the first node. | |
NodeIt (const Graph &, const Node &) | |
Node -> NodeIt conversion. | |
NodeIt & | operator++ () |
Next node. |
NodeIt | ( | ) | [inline] |
Initialize the iterator to be invalid.
Sets the iterator to the node of the
graph pointed by the trivial iterator. This feature necessitates that each time we iterate the arc-set, the iteration order is the same.
NodeIt& operator++ | ( | ) | [inline] |
Assign the iterator to the next node.