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