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 outgoing arcs of a node n
in digraph g
of type Digraph
as follows.
int count=0; for(Digraph::InArcIt e(g, n); e!=INVALID; ++e) ++count;
#include <lemon/concepts/digraph.h>
Public Member Functions | |
InArcIt () | |
Default constructor. | |
InArcIt (const InArcIt &e) | |
InArcIt (Invalid) | |
InArcIt (const Digraph &, const Node &) | |
This constructor sets the iterator to first incoming arc. | |
InArcIt (const Digraph &, const Arc &) | |
Arc -> InArcIt conversion. | |
InArcIt & | operator++ () |
Next incoming arc. |
InArcIt | ( | ) | [inline] |
This constructor set the iterator to the first incoming arc of the node.
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.
InArcIt& operator++ | ( | ) | [inline] |
Assign the iterator to the next inarc of the corresponding node.