![]() |
abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
|
Iterator class for the edges. More...
#include <lemon/concepts/bpgraph.h>
Public Member Functions | |
| EdgeIt () | |
| Default constructor. | |
| EdgeIt (const EdgeIt &e) | |
| Copy constructor. | |
| const EdgeIt & | operator= (const EdgeIt &) |
| Assignment operator. | |
| 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. | |
| Public Member Functions inherited from BpGraph::Edge | |
| Edge () | |
| Default constructor. | |
| Edge (const Edge &) | |
| Copy constructor. | |
| const Edge & | operator= (const Edge &) |
| Assignment operator. | |
| Edge (Invalid) | |
| Invalid constructor & conversion. | |
| bool | operator== (Edge) const |
| Equality operator. | |
| bool | operator!= (Edge) const |
| Inequality operator. | |
| bool | operator< (Edge) const |
| Artificial ordering operator. | |
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:
|
inline |
Default constructor.
|
inline |
Copy constructor.
|
inlineexplicit |
Sets the iterator to the first edge of the given graph.
Sets the iterator to the given edge of the given graph.
|
inline |
Assign the iterator to the next edge.