![]() |
Pangolin
Header-only C++20 plane computational geometry library
|
Forward iterator over the vertices of a graph. More...
#include <graph.hpp>
Public Types | |
| using | iterator_category = std::forward_iterator_tag |
| using | iterator_concept = std::forward_iterator_tag |
| using | difference_type = std::ptrdiff_t |
| using | value_type = Vertex |
| using | pointer = const Vertex* |
| using | reference = const Vertex& |
Public Member Functions | |
| Iterator ()=default | |
| Creates an iterator with no associated graph. | |
| reference | operator* () const |
| Returns the current vertex. | |
| pointer | operator-> () const |
| Returns a pointer to the current vertex. | |
| Iterator & | operator++ () |
| Advances to the next vertex. | |
| Iterator | operator++ (int) |
| Advances to the next vertex and returns the previous position. | |
Friends | |
| class | Graph |
| bool | operator== (const Iterator &, const Iterator &)=default |
Forward iterator over the vertices of a graph.
Dereferencing the iterator yields a const reference because changing a vertex in place would invalidate the graph's hash table.
| using pgl::Graph< Vertex >::Iterator::difference_type = std::ptrdiff_t |
| using pgl::Graph< Vertex >::Iterator::iterator_category = std::forward_iterator_tag |
| using pgl::Graph< Vertex >::Iterator::iterator_concept = std::forward_iterator_tag |
| using pgl::Graph< Vertex >::Iterator::pointer = const Vertex* |
| using pgl::Graph< Vertex >::Iterator::reference = const Vertex& |
| using pgl::Graph< Vertex >::Iterator::value_type = Vertex |
|
default |
Creates an iterator with no associated graph.
|
inline |
Returns the current vertex.
|
inline |
Advances to the next vertex.
|
inline |
Advances to the next vertex and returns the previous position.
|
inline |
Returns a pointer to the current vertex.
|
friend |