#include <lemon/concept/graph.h>
Inheritance diagram for StaticGraph::NodeIt:
g
of type Graph
like this: int count=0; for (Graph::NodeIt n(g); n!=INVALID ++n) ++count;
Definition at line 177 of file graph.h.
Public Member Functions | |
NodeIt () | |
Default constructor. | |
NodeIt (const NodeIt &) | |
Copy constructor. | |
NodeIt (Invalid) | |
Invalid constructor & conversion. | |
NodeIt (const StaticGraph &g) | |
Sets the iterator to the first node. | |
NodeIt (const StaticGraph &g, const Node &n) | |
Node -> NodeIt conversion. | |
NodeIt & | operator++ () |
Next node. |
|
|
|
Copy constructor. |
|
Initialize the iterator to be invalid.
|
|
Sets the iterator to the first node of |
|
Sets the iterator to the node of |
|
Assign the iterator to the next node. |