graphgen::undirected_graph::isequence Class Reference
Simple node sequence iterator. More...
#include <iterator.hpp>
Collaboration diagram for graphgen::undirected_graph::isequence:
Public Member Functions | |
| isequence (const undirected_graph &g) | |
| create sequence iterator for given graph | |
| vertex_type | operator* () const |
| derefernce returns the graph vertex identifier | |
| isequence & | operator++ () |
| advance to the next vertex | |
| bool | operator== (const isequence &rhs) const |
| comparison of iterators returns true if iterators of the same graph object point to the same vertex | |
| bool | valid () const |
| test the validity of the iterator. | |
| link_type | via () const |
| return the link via that the iterator got to the vertex. | |
Detailed Description
Simple node sequence iterator.
- Todo:
- re-definition
- Todo:
- change to use undirected_graph::vertex_pool when implemented. This would allow random access use of this iterator
Member Function Documentation
| bool graphgen::undirected_graph::isequence::valid | ( | ) | const [inline] |
test the validity of the iterator.
This must be used to avoid vertex range overflow
References graphgen::undirected_graph::nv().
| link_type graphgen::undirected_graph::isequence::via | ( | ) | const [inline] |
return the link via that the iterator got to the vertex.
This is not applicable for the sequence iterator, and thsu returns an invalid link identifier
The documentation for this class was generated from the following file:
