Node comparer for sorting by decreasing int values. More...

Public Member Functions
	AddNodeComparer (HashArray< int, int > &ha)
int	compare (const node &v1, const node &v2) const
bool	less (const node &x, const node &y) const
bool	leq (const node &x, const node &y) const
bool	greater (const node &x, const node &y) const
bool	geq (const node &x, const node &y) const
bool	equal (const node &x, const node &y) const
Private Attributes
HashArray< int, int > *	m_indToDeg

Detailed Description

Node comparer for sorting by decreasing int values.

Definition at line 398 of file PlanarizationLayout.h.

Constructor & Destructor Documentation

ogdf::AddNodeComparer::AddNodeComparer ( HashArray< int, int > & ha ) [inline]

Definition at line 403 of file PlanarizationLayout.h.

int ogdf::AddNodeComparer::compare	(	const node &	v1,
		const node &	v2
	)			const `[inline]`

Definition at line 405 of file PlanarizationLayout.h.

bool ogdf::AddNodeComparer::equal	(	const node &	x,
		const node &	y
	)			const `[inline]`

Definition at line 414 of file PlanarizationLayout.h.

bool ogdf::AddNodeComparer::geq	(	const node &	x,
		const node &	y
	)			const `[inline]`

Definition at line 414 of file PlanarizationLayout.h.

bool ogdf::AddNodeComparer::greater	(	const node &	x,
		const node &	y
	)			const `[inline]`

Definition at line 414 of file PlanarizationLayout.h.

bool ogdf::AddNodeComparer::leq	(	const node &	x,
		const node &	y
	)			const `[inline]`

Definition at line 414 of file PlanarizationLayout.h.

bool ogdf::AddNodeComparer::less	(	const node &	x,
		const node &	y
	)			const `[inline]`

Definition at line 414 of file PlanarizationLayout.h.

Definition at line 400 of file PlanarizationLayout.h.

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