g
of type Digraph
like this: int count=0; for (Digraph::NodeIt n(g); n!=INVALID; ++n) ++count;
#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. |
NodeIt | ( | ) | [inline] |
Default constructor.
Initializes the iterator to be invalid.
Sets the iterator to the first node of the given digraph.
Sets the iterator to the given node of the given digraph.
NodeIt& operator++ | ( | ) | [inline] |
Assign the iterator to the next node.