#include <lemon/concept/graph.h>
Inheritance diagram for StaticGraph::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 259 of file graph.h.
Public Member Functions | |
OutEdgeIt () | |
Default constructor. | |
OutEdgeIt (const OutEdgeIt &) | |
Copy constructor. | |
OutEdgeIt (Invalid) | |
Initialize the iterator to be invalid. | |
OutEdgeIt (const StaticGraph &g, const Node &n) | |
This constructor sets the iterator to first outgoing edge. | |
OutEdgeIt (const StaticGraph &g, const Edge &e) | |
Edge -> OutEdgeIt conversion. | |
OutEdgeIt & | operator++ () |
Next outgoing edge. |
|
|
|
Copy constructor. |
|
Initialize the iterator to be invalid. |
|
This constructor set the iterator to the first outgoing edge of node
|
|
Sets the iterator to the value of the trivial iterator |
|
Assign the iterator to the next outgoing edge of the corresponding node. |