This iterator goes through each directed arc of the graph. Its usage is quite simple, for example, you can count the number of arcs in a graph g of type Graph as follows: 
#include <lemon/concepts/graph.h>
 Inheritance diagram for Graph::ArcIt:
 Inheritance diagram for Graph::ArcIt:| Public Member Functions | |
| ArcIt () | |
| Default constructor.  More... | |
| ArcIt (const ArcIt &e) | |
| Copy constructor.  More... | |
| ArcIt (Invalid) | |
| Invalid constructor & conversion.  More... | |
| ArcIt (const Graph &g) | |
| Sets the iterator to the first arc.  More... | |
| ArcIt (const Graph &, const Arc &) | |
| Sets the iterator to the given arc.  More... | |
| ArcIt & | operator++ () | 
| Next arc.  More... | |
|  Public Member Functions inherited from Graph::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... | |
| operator Edge () const | |
| Converison to Edge.  More... | |
| 
 | inline | 
Default constructor.
| 
 | inline | 
Assign the iterator to the next arc.
 1.8.5
 1.8.5