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