This iterator goes through each edge of the graph. Its usage is quite simple, for example, you can count the number of edges in a graph g of type BpGraph as follows: 
#include <lemon/concepts/bpgraph.h>
 Inheritance diagram for BpGraph::EdgeIt:
 Inheritance diagram for BpGraph::EdgeIt:| Public Member Functions | |
| EdgeIt () | |
| Default constructor.  More... | |
| EdgeIt (const EdgeIt &e) | |
| Copy constructor.  More... | |
| EdgeIt (Invalid) | |
| Invalid constructor & conversion.  More... | |
| EdgeIt (const BpGraph &) | |
| Sets the iterator to the first edge.  More... | |
| EdgeIt (const BpGraph &, const Edge &) | |
| Sets the iterator to the given edge.  More... | |
| EdgeIt & | operator++ () | 
| Next edge.  More... | |
|  Public Member Functions inherited from BpGraph::Edge | |
| Edge () | |
| Default constructor.  More... | |
| Edge (const Edge &) | |
| Copy constructor.  More... | |
| Edge (Invalid) | |
| Invalid constructor & conversion.  More... | |
| bool | operator== (Edge) const | 
| Equality operator.  More... | |
| bool | operator!= (Edge) const | 
| Inequality operator.  More... | |
| bool | operator< (Edge) const | 
| Artificial ordering operator.  More... | |
| 
 | inline | 
Default constructor.
Sets the iterator to the given edge of the given graph.
| 
 | inline | 
Assign the iterator to the next edge.
 1.8.5
 1.8.5