This class circulates through all one-ring neighbors of a vertex. It also acts as a container-concept for C++11 range-based for loops.
More...
#include <graph.h>
This class circulates through all one-ring neighbors of a vertex. It also acts as a container-concept for C++11 range-based for loops.
- See also
- EdgeAroundVertexCirculator, vertices(Vertex)
- Examples
- Tutorial_109_Graph_Connectivity/main.cpp.
◆ operator bool()
Cast to bool: true if vertex is not isolated.
- Returns
- True if vertex is not isolated, false otherwise.
◆ operator!=()
Inequality operator.
- Parameters
-
| rhs | The other circulator to compare with. |
- Returns
- True if the circulators are different, false otherwise.
◆ operator*()
Get the vertex the circulator refers to.
- Returns
- The vertex.
◆ operator++()
Pre-increment circulator.
- Returns
- A reference to the incremented circulator.
◆ operator--()
Pre-decrement circulator.
- Returns
- A reference to the decremented circulator.
◆ operator==()
Equality operator.
- Parameters
-
| rhs | The other circulator to compare with. |
- Returns
- True if the circulators are equal, false otherwise.
◆ vertex()
Return current vertex.
- Returns
- The vertex.
The documentation for this class was generated from the following file: