This class describes the concept of NodeIt, ArcIt and EdgeIt subtypes of digraph and graph types. 
#include <lemon/concepts/graph_components.h>
Inherits Item.
| Public Member Functions | |
| GraphItemIt () | |
| Default constructor.  More... | |
| GraphItemIt (const GraphItemIt &it) | |
| Copy constructor.  More... | |
| GraphItemIt (const GR &) | |
| Constructor that sets the iterator to the first item.  More... | |
| GraphItemIt (Invalid) | |
| Constructor for conversion from INVALID.  More... | |
| GraphItemIt & | operator= (const GraphItemIt &) | 
| Assignment operator.  More... | |
| GraphItemIt & | operator++ () | 
| Increment the iterator.  More... | |
| bool | operator== (const GraphItemIt &) const | 
| Equality operator.  More... | |
| bool | operator!= (const GraphItemIt &) const | 
| Inequality operator.  More... | |
| 
 | inline | 
Default constructor.
| 
 | inline | 
Copy constructor.
| 
 | inlineexplicit | 
Constructor that sets the iterator to the first item.
| 
 | 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 item.
| 
 | 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
 1.8.5