This class describes the concept of InArcIt, OutArcIt and IncEdgeIt subtypes of digraph and graph types.
sel. For InArcIt you should instantiate it with character 'i', for OutArcIt with 'o' and for IncEdgeIt with 'e'. #include <lemon/concepts/graph_components.h>
Inherits Item.
Public Member Functions | |
| GraphIncIt () | |
| Default constructor. More... | |
| GraphIncIt (const GraphIncIt &it) | |
| Copy constructor. More... | |
| GraphIncIt (const GR &, const Base &) | |
| Constructor that sets the iterator to the first incoming or outgoing arc. More... | |
| GraphIncIt (Invalid) | |
Constructor for conversion from INVALID. More... | |
| GraphIncIt & | operator= (const GraphIncIt &) |
| Assignment operator. More... | |
| GraphIncIt & | operator++ () |
| Increment the iterator. More... | |
| bool | operator== (const GraphIncIt &) const |
| Equality operator. More... | |
| bool | operator!= (const GraphIncIt &) const |
| Inequality operator. More... | |
|
inline |
Default constructor.
|
inline |
Copy constructor.
|
inlineexplicit |
Constructor that sets the iterator to the first arc incoming to or outgoing from the given node.
|
inline |
Constructor for conversion from INVALID. It initializes the iterator to be invalid.
|
inline |
Assignment operator for the iterator.
|
inline |
This operator increments the iterator, i.e. assigns it to the next arc incoming to or outgoing from the given node.
|
inline |
Equality operator. Two iterators are equal if and only if they point to the same object or both are invalid.
|
inline |
Inequality operator. Two iterators are equal if and only if they point to the same object or both are invalid.
1.8.5