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;
const Invalid INVALID
Invalid iterators.
Definition base.cc:32
Iterator class for the edges.
Definition bpgraph.h:364
#include <lemon/concepts/bpgraph.h>
◆ EdgeIt() [1/5]
Default constructor.
- Warning
- It sets the iterator to an undefined value.
◆ EdgeIt() [2/5]
| EdgeIt |
( |
const EdgeIt & | e | ) |
|
|
inline |
◆ EdgeIt() [3/5]
Initializes the iterator to be invalid.
- See also
- Invalid for more details.
◆ EdgeIt() [4/5]
Sets the iterator to the first edge of the given graph.
◆ EdgeIt() [5/5]
Sets the iterator to the given edge of the given graph.
◆ operator++()
Assign the iterator to the next edge.