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>
Public Member Functions | |
ArcIt () | |
Default constructor. | |
ArcIt (const ArcIt &e) | |
ArcIt (Invalid) | |
Invalid constructor & conversion. | |
ArcIt (const Graph &g) | |
Sets the iterator to the first arc. | |
ArcIt (const Graph &, const Arc &) | |
Sets the iterator to the given arc. | |
ArcIt & | operator++ () |
Next arc. | |
![]() | |
Arc () | |
Default constructor. | |
Arc (const Arc &) | |
Arc (Invalid) | |
Invalid constructor & conversion. | |
bool | operator== (Arc) const |
Equality operator. | |
bool | operator!= (Arc) const |
bool | operator< (Arc) const |
Artificial ordering operator. | |
operator Edge () const | |
|
inline |
Default constructor.
|
inline |
Assign the iterator to the next arc.