n
in a graph g
of type Graph
as follows. int count=0; for (Digraph::InArcIt a(g, n); a!=INVALID; ++a) ++count;
#include <lemon/concepts/graph.h>
Inherits lemon::SmartGraphBase::Arc.
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. |
InArcIt | ( | ) | [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.
InArcIt& operator++ | ( | ) | [inline] |
Assign the iterator to the next incoming arc of the corresponding node.