This iterator goes trough the incoming arcs of a certain node of a digraph. Its usage is quite simple, for example, you can count the number of incoming arcs of a node n
in a digraph g
of type Digraph
as follows.
#include <lemon/concepts/digraph.h>
Public Member Functions | |
InArcIt () | |
Default constructor. More... | |
InArcIt (const InArcIt &e) | |
Copy constructor. More... | |
InArcIt (Invalid) | |
Invalid constructor & conversion. More... | |
InArcIt (const Digraph &, const Node &) | |
Sets the iterator to the first incoming arc. More... | |
InArcIt (const Digraph &, const Arc &) | |
Sets the iterator to the given arc. More... | |
InArcIt & | operator++ () |
Next incoming 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 incoming arc of the given node.
Sets the iterator to the given arc of the given digraph.
|
inline |
Assign the iterator to the next incoming arc of the corresponding node.