This class implements the node iterator of a path structure. To provide this feature, the underlying graph should be given to the constructor of the iterator. #include <lemon/path_utils.h>
Public Member Functions | |
| PathNodeIt () | |
| Default constructor. | |
| PathNodeIt (Invalid) | |
| Invalid constructor. | |
| PathNodeIt (const Graph &graph, const Path &path) | |
| Constructor. | |
| PathNodeIt (const Graph &graph, const Path &path, const Node &src) | |
| Constructor. | |
| operator Node () const | |
| Conversion to Graph::Node. | |
| PathNodeIt & | operator++ () |
| Next node. | |
| bool | operator== (const PathNodeIt &n) const |
| Comparison operator. | |
| bool | operator!= (const PathNodeIt &n) const |
| Comparison operator. | |
| bool | operator< (const PathNodeIt &n) const |
| Comparison operator. | |
1.5.9