internal::GridReordering3d::CheapEdge Struct Reference

List of all members.

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

Detailed Description

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 & Destructor Documentation

internal::GridReordering3d::CheapEdge::CheapEdge ( const unsigned int  n0,
const unsigned int  n1 
)

Constructor. Take the vertex numbers and store them sorted.


Member Function Documentation

bool internal::GridReordering3d::CheapEdge::operator< ( const CheapEdge e2  )  const

Need a partial ordering for the STL


Member Data Documentation

The first node

The second node


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

deal.II documentation generated on Mon Nov 23 22:58:23 2009 by doxygen 1.6.1