![]() |
Reference documentation for deal.II version 8.1.0
|
#include <grid_reordering_internal.h>
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.
Definition at line 460 of file grid_reordering_internal.h.
Constructor. Take the vertex numbers and store them sorted.
Need a partial ordering for the STL
const unsigned int internal::GridReordering3d::CheapEdge::node0 |
The first node
Definition at line 465 of file grid_reordering_internal.h.
const unsigned int internal::GridReordering3d::CheapEdge::node1 |
The second node
Definition at line 470 of file grid_reordering_internal.h.