This iterator goes trough the outgoing arcs of a certain node of a digraph. Its usage is quite simple, for example you can count the number of outgoing arcs of a node n
in digraph g
of type Digraph
as follows.
#include <lemon/concepts/digraph.h>
Public Member Functions | |
OutArcIt () | |
Default constructor. | |
OutArcIt (const OutArcIt &e) | |
OutArcIt (Invalid) | |
OutArcIt (const Digraph &, const Node &) | |
This constructor sets the iterator to the first outgoing arc. | |
OutArcIt (const Digraph &, const Arc &) | |
Arc -> OutArcIt conversion. | |
OutArcIt & | operator++ () |
Next outgoing arc. | |
![]() | |
Arc () | |
Default constructor. | |
Arc (const Arc &) | |
Arc (Invalid) | |
bool | operator== (Arc) const |
Equality operator. | |
bool | operator!= (Arc) const |
Inequality operator. | |
bool | operator< (Arc) const |
Artificial ordering operator. | |
|
inline |
This constructor sets the iterator to the first outgoing arc of the node.
Sets the iterator to the value of the trivial iterator. This feature necessitates that each time we iterate the arc-set, the iteration order is the same.
|
inline |
Assign the iterator to the next outgoing arc of the corresponding node.