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