DGtal 1.3.0
|
#include <DGtal/topology/DigitalSurface.h>
Public Member Functions | |
Edge (const Vertex &v1, const Vertex &v2) | |
bool | operator== (const Edge &other) const |
bool | operator< (const Edge &other) const |
Data Fields | |
Vertex | vertices [2] |
The two vertices. More... | |
An edge is a unordered pair of vertices. To make comparisons easier, the smallest vertex is stored before the greatest vertex. Note that loops are legal.
Definition at line 192 of file DigitalSurface.h.
|
inline |
Constructor from vertices.
v1 | the first vertex. |
v2 | the second vertex. |
Definition at line 200 of file DigitalSurface.h.
References DGtal::DigitalSurface< TDigitalSurfaceContainer >::Edge::vertices.
|
inline |
Definition at line 218 of file DigitalSurface.h.
References DGtal::DigitalSurface< TDigitalSurfaceContainer >::Edge::vertices.
|
inline |
Definition at line 213 of file DigitalSurface.h.
References DGtal::DigitalSurface< TDigitalSurfaceContainer >::Edge::vertices.
Vertex DGtal::DigitalSurface< TDigitalSurfaceContainer >::Edge::vertices[2] |
The two vertices.
Definition at line 194 of file DigitalSurface.h.
Referenced by DGtal::DigitalSurface< TDigitalSurfaceContainer >::Edge::Edge(), DGtal::DigitalSurface< TDigitalSurfaceContainer >::Edge::operator<(), and DGtal::DigitalSurface< TDigitalSurfaceContainer >::Edge::operator==().