#include <lemon/concept/graph.h>
Inherits StaticGraph::Edge.
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;
Public Member Functions | |
OutEdgeIt () | |
Default constructor. | |
OutEdgeIt (const OutEdgeIt &e) | |
Copy constructor. | |
OutEdgeIt (Invalid) | |
Initialize the iterator to be invalid. | |
OutEdgeIt (const StaticGraph &, const Node &) | |
This constructor sets the iterator to the first outgoing edge. | |
OutEdgeIt (const StaticGraph &, const Edge &) | |
Edge -> OutEdgeIt conversion. | |
OutEdgeIt & | operator++ () |
Next outgoing edge. |
|
|
|
Copy constructor. |
|
Initialize the iterator to be invalid. |
|
This constructor sets the iterator to the first outgoing edge of the node. |
|
Sets the iterator to the value of the trivial iterator. This feature necessitates that each time we iterate the edge-set, the iteration order is the same. |
|
Assign the iterator to the next outgoing edge of the corresponding node. |