Graph::EdgeAroundVertexCirculator Class Reference

#include <graph.h>

Public Member Functions
	EdgeAroundVertexCirculator (const Graph *g, Vertex v=Vertex())
	default constructor
bool	operator== (const EdgeAroundVertexCirculator &rhs) const
	are two circulators equal?
bool	operator!= (const EdgeAroundVertexCirculator &rhs) const
	are two circulators different?
EdgeAroundVertexCirculator &	operator++ ()
	pre-increment
EdgeAroundVertexCirculator &	operator-- ()
	pre-decrement
Edge	operator* () const
	get the edge the circulator refers to
	operator bool () const
	cast to bool: true if vertex is not isolated
Vertex	vertex () const
	return current vertex
EdgeAroundVertexCirculator &	begin ()
EdgeAroundVertexCirculator &	end ()

Detailed Description

this class circulates through all edges connected with a vertex. it also acts as a container-concept for C++11 range-based for loops.

See also

VertexAroundVertexCirculator, edges(Vertex)

Examples

Tutorial_109_Graph_Connectivity.

---

The documentation for this class was generated from the following file:

• /Users/lnan/Documents/Projects/Easy3D/easy3d/core/graph.h