#include <lemon/concepts/graph.h>
g
of type Graph
as follows: int count=0; for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
Public Member Functions | |
EdgeIt () | |
Default constructor. | |
EdgeIt (const EdgeIt &e) | |
Copy constructor. | |
EdgeIt (Invalid) | |
Initialize the iterator to be invalid. | |
EdgeIt (const Graph &) | |
This constructor sets the iterator to the first edge. | |
EdgeIt (const Graph &, const Edge &) | |
Edge -> EdgeIt conversion. | |
EdgeIt & | operator++ () |
Next edge. |
EdgeIt | ( | ) | [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.
EdgeIt& operator++ | ( | ) | [inline] |
Assign the iterator to the next edge.