Public Member Functions | |
CheapEdge (const unsigned int n0, const unsigned int n1) | |
bool | operator< (const CheapEdge &e2) const |
Public Attributes | |
const unsigned int | node0 |
const unsigned int | node1 |
During building the connectivity information we don't need all the heavy duty information about edges that we will need later. So we can save memory and time by using a light-weight class for edges. It stores the two vertices, but no direction, so we make the optimization to store the vertex number in sorted order to allow for easier comparison of edge objects.
Constructor. Take the vertex numbers and store them sorted.
Need a partial ordering for the STL
The first node
The second node