This iterator goes through each edge of a graph. Its usage is quite simple, for example you can count the number of edges in a graph g
of type Graph
as follows:
#include <lemon/concepts/graph.h>
Public Member Functions | |
EdgeIt () | |
Default constructor. | |
EdgeIt (const EdgeIt &e) | |
EdgeIt (Invalid) | |
EdgeIt (const Graph &) | |
EdgeIt (const Graph &, const Edge &) | |
Edge -> EdgeIt conversion. | |
EdgeIt & | operator++ () |
Next edge. | |
![]() | |
Edge () | |
Default constructor. | |
Edge (const Edge &) | |
Edge (Invalid) | |
bool | operator== (Edge) const |
Equality operator. | |
bool | operator!= (Edge) const |
Inequality operator. | |
bool | operator< (Edge) const |
Artificial ordering operator. | |
|
inline |
Sets the iterator to the value of the trivial iterator. This feature necessitates that each time we iterate the edge-set, the iteration order is the same.
|
inline |
Assign the iterator to the next edge.