Iterator class for the incident edges of a node.
More...
#include <lemon/concepts/bpgraph.h>
This iterator goes trough the incident undirected edges of a certain node of a graph. Its usage is quite simple, for example, you can compute the degree (i.e. the number of incident edges) of a node n in a graph g of type BpGraph as follows.
int count = 0;
++count;
Iterator class for the incident edges of a node.
Definition bpgraph.h:532
const Invalid INVALID
Invalid iterators.
Definition base.cc:33
- Warning
- Loop edges will be iterated twice.
◆ IncEdgeIt() [1/5]
Default constructor.
- Warning
- It sets the iterator to an undefined value.
◆ IncEdgeIt() [2/5]
| IncEdgeIt |
( |
const IncEdgeIt & | e | ) |
|
|
inline |
◆ IncEdgeIt() [3/5]
Initializes the iterator to be invalid.
- See also
- Invalid for more details.
◆ IncEdgeIt() [4/5]
| IncEdgeIt |
( |
const BpGraph & | , |
|
|
const Node & | ) |
|
inline |
Sets the iterator to the first incident edge of the given node.
◆ IncEdgeIt() [5/5]
Sets the iterator to the given edge of the given graph.
◆ operator=()
◆ operator++()
Assign the iterator to the next incident edge of the corresponding node.