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