#include <lemon/concept/sym_graph.h>
Inheritance diagram for StaticSymGraph::OutEdgeIt:
n
in graph g
of type Graph
as follows. int count=0; for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
Definition at line 251 of file sym_graph.h.
Public Member Functions | |
OutEdgeIt () | |
Default constructor. | |
OutEdgeIt (const OutEdgeIt &) | |
Copy constructor. | |
OutEdgeIt (Invalid) | |
Initialize the iterator to be invalid. | |
OutEdgeIt (const StaticSymGraph &g, const Node &n) | |
This constructor sets the iterator to first outgoing edge. | |
OutEdgeIt (const StaticSymGraph &g, const Edge &e) | |
Edge -> OutEdgeIt conversion. | |
OutEdgeIt & | operator++ () |
Next outgoing edge. |
|
Definition at line 257 of file sym_graph.h. |
|
Copy constructor. Definition at line 262 of file sym_graph.h. |
|
Initialize the iterator to be invalid. Definition at line 267 of file sym_graph.h. |
|
This constructor set the iterator to the first outgoing edge of node
Definition at line 274 of file sym_graph.h. |
|
Sets the iterator to the value of the trivial iterator Definition at line 280 of file sym_graph.h. |
|
Assign the iterator to the next outgoing edge of the corresponding node. Definition at line 285 of file sym_graph.h. |