#include <deal.II/grid/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

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.

Definition at line 355 of file grid_reordering_internal.h.

Constructor & Destructor Documentation

§ CheapEdge()

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

Constructor. Take the vertex numbers and store them sorted.

Definition at line 891 of file grid_reordering.cc.

Member Function Documentation

§ operator<()

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

Need a partial ordering for sorting algorithms

Definition at line 904 of file grid_reordering.cc.

Member Data Documentation

§ node0

const unsigned int internal::GridReordering3d::CheapEdge::node0

The first node

Definition at line 360 of file grid_reordering_internal.h.

§ node1

const unsigned int internal::GridReordering3d::CheapEdge::node1

The second node

Definition at line 365 of file grid_reordering_internal.h.

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

deal.II/grid/grid_reordering_internal.h
/build/deal.ii-pdtiAo/deal.ii-8.4.2/source/grid/grid_reordering.cc

Public Member Functions

Public Attributes