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