This iterator goes trough the incoming arcs of a certain node of a graph. Its usage is quite simple, for example you can count the number of outgoing arcs of a node n
in graph g
of type Graph
as follows.
#include <lemon/concepts/graph.h>
Public Member Functions | |
InArcIt () | |
Default constructor. | |
InArcIt (const InArcIt &e) | |
InArcIt (Invalid) | |
InArcIt (const Graph &g, const Node &n) | |
This constructor sets the iterator to first incoming arc. | |
InArcIt (const Graph &, const Arc &) | |
Arc -> InArcIt conversion. | |
InArcIt & | operator++ () |
Next incoming 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. | |
operator Edge () const | |
Converison to Edge. | |
|
inline |
This constructor set the iterator to the first incoming arc of the node.
n | the node |
g | the graph |
Sets the iterator to the value of the trivial iterator e
. This feature necessitates that each time we iterate the arc-set, the iteration order is the same.
|
inline |
Assign the iterator to the next inarc of the corresponding node.