#include <lemon/concepts/graph.h>
Inherits Graph::Edge.
Inheritance diagram for Graph::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 Graph &, const Node &) | |
This constructor sets the iterator to the first outgoing edge. | |
OutEdgeIt (const Graph &, const Edge &) | |
Edge -> OutEdgeIt conversion. | |
OutEdgeIt & | operator++ () |
Next outgoing edge. |
OutEdgeIt | ( | ) | [inline] |
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.
OutEdgeIt& operator++ | ( | ) | [inline] |
Assign the iterator to the next outgoing edge of the corresponding node.