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