#include <lemon/concept/sym_graph.h>
Inheritance diagram for StaticSymGraph::EdgeIt:
g
of type Graph
as follows: int count=0; for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
Definition at line 389 of file sym_graph.h.
Public Member Functions | |
EdgeIt () | |
Default constructor. | |
EdgeIt (const EdgeIt &) | |
Copy constructor. | |
EdgeIt (Invalid) | |
Initialize the iterator to be invalid. | |
EdgeIt (const StaticSymGraph &g) | |
This constructor sets the iterator to first edge. | |
EdgeIt (const StaticSymGraph &, const Edge &) | |
Edge -> EdgeIt conversion. | |
EdgeIt & | operator++ () |
Next edge. |
|
Definition at line 395 of file sym_graph.h. |
|
Copy constructor. Definition at line 400 of file sym_graph.h. |
|
Initialize the iterator to be invalid. Definition at line 405 of file sym_graph.h. |
|
This constructor set the iterator to the first edge of node
Definition at line 411 of file sym_graph.h. |
|
Sets the iterator to the value of the trivial iterator Definition at line 417 of file sym_graph.h. |
|
Assign the iterator to the next edge of the corresponding node. Definition at line 422 of file sym_graph.h. |