This class describes the concept of NodeIt, ArcIt and EdgeIt subtypes of digraph and graph types.
#include <lemon/concepts/graph_components.h>
Public Member Functions | |
| GraphItemIt () | |
| Default constructor. | |
| GraphItemIt (const GraphItemIt &it) | |
| GraphItemIt (const GR &) | |
| GraphItemIt (Invalid) | |
Constructor for conversion from INVALID. | |
| GraphItemIt & | operator= (const GraphItemIt &) |
| Assignment operator. | |
| GraphItemIt & | operator++ () |
| Increment the iterator. | |
| bool | operator== (const GraphItemIt &) const |
| Equality operator. | |
| bool | operator!= (const GraphItemIt &) const |
| Inequality operator. | |
| GraphItemIt | ( | ) | [inline] |
Default constructor.
| GraphItemIt | ( | const GraphItemIt< GR, Item > & | it | ) | [inline] |
Copy constructor.
| GraphItemIt | ( | const GR & | ) | [inline, explicit] |
Constructor that sets the iterator to the first item.
| GraphItemIt | ( | Invalid | ) | [inline] |
Constructor for conversion from INVALID. It initializes the iterator to be invalid.
| GraphItemIt& operator= | ( | const GraphItemIt< GR, Item > & | ) | [inline] |
Assignment operator for the iterator.
| GraphItemIt& operator++ | ( | ) | [inline] |
This operator increments the iterator, i.e. assigns it to the next item.
| bool operator== | ( | const GraphItemIt< GR, Item > & | ) | const [inline] |
Equality operator. Two iterators are equal if and only if they point to the same object or both are invalid.
| bool operator!= | ( | const GraphItemIt< GR, Item > & | ) | const [inline] |
Inequality operator. Two iterators are equal if and only if they point to the same object or both are invalid.
1.7.3