This iterator goes through each node of the graph. Its usage is quite simple, for example, you can count the number of nodes in a graph g
of type BpGraph
like this:
int count=0; for (BpGraph::NodeIt n(g); n!=INVALID; ++n) ++count;
#include <lemon/concepts/bpgraph.h>
Public Member Functions | |
NodeIt () | |
Default constructor. | |
NodeIt (const NodeIt &n) | |
NodeIt (Invalid) | |
Invalid constructor & conversion. | |
NodeIt (const BpGraph &) | |
Sets the iterator to the first node. | |
NodeIt (const BpGraph &, 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.