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 a digraph g
of type Digraph
as follows.
#include <lemon/concepts/digraph.h>
Public Member Functions | |
OutArcIt () | |
Default constructor. More... | |
OutArcIt (const OutArcIt &e) | |
Copy constructor. More... | |
OutArcIt (Invalid) | |
Invalid constructor & conversion. More... | |
OutArcIt (const Digraph &, const Node &) | |
Sets the iterator to the first outgoing arc. More... | |
OutArcIt (const Digraph &, const Arc &) | |
Sets the iterator to the given arc. More... | |
OutArcIt & | operator++ () |
Next outgoing arc. More... | |
Public Member Functions inherited from Digraph::Arc | |
Arc () | |
Default constructor. More... | |
Arc (const Arc &) | |
Copy constructor. More... | |
Arc (Invalid) | |
Invalid constructor & conversion. More... | |
bool | operator== (Arc) const |
Equality operator. More... | |
bool | operator!= (Arc) const |
Inequality operator. More... | |
bool | operator< (Arc) const |
Artificial ordering operator. More... | |
|
inline |
Default constructor.
Initializes the iterator to be invalid.
Sets the iterator to the first outgoing arc of the given node.
Sets the iterator to the given arc of the given digraph.
|
inline |
Assign the iterator to the next outgoing arc of the corresponding node.