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