ogdf::LeftistOrdering Class Reference

#include <ogdf/planarlayout/LeftistOrdering.h>

Classes
struct	Candidate
class	Partitioning

Public Member Functions
bool	call (const Graph &G, adjEntry adj_v1n, List< List< node >> &result)
bool	call (const Graph &G, adjEntry adj_v1n, Partitioning &partition)

Private Member Functions
void	beltExtension (List< Candidate > &extension)
bool	forbidden (node v) const
bool	isSingletonWith (const Candidate &c, node v) const
bool	leftmostFeasibleCandidate (List< node > &result)
bool	singular (node v) const
void	updateBelt ()

Private Attributes
List< Candidate >	m_belt
List< Candidate >::iterator	m_currCandidateIt
NodeArray< int >	m_cutEdges
NodeArray< int >	m_cutFaces
AdjEntryArray< bool >	m_marked

Detailed Description

Definition at line 43 of file LeftistOrdering.h.

Member Function Documentation

beltExtension()

void ogdf::LeftistOrdering::beltExtension ( List< Candidate > &  extension )

private

call() [1/2]

bool ogdf::LeftistOrdering::call	(	const Graph &	G,
		adjEntry	adj_v1n,
		List< List< node >> &	result
	)

call() [2/2]

bool ogdf::LeftistOrdering::call ( const Graph &  G, adjEntry  adj_v1n, Partitioning &  partition  )

inline

Definition at line 147 of file LeftistOrdering.h.

forbidden()

bool ogdf::LeftistOrdering::forbidden ( node  v ) const

inlineprivate

Definition at line 76 of file LeftistOrdering.h.

isSingletonWith()

bool ogdf::LeftistOrdering::isSingletonWith ( const Candidate &  c, node  v  ) const

private

leftmostFeasibleCandidate()

bool ogdf::LeftistOrdering::leftmostFeasibleCandidate ( List< node > &  result )

private

singular()

bool ogdf::LeftistOrdering::singular ( node  v ) const

inlineprivate

Definition at line 82 of file LeftistOrdering.h.

updateBelt()

void ogdf::LeftistOrdering::updateBelt ( )

private

Member Data Documentation

m_belt

List<Candidate> ogdf::LeftistOrdering::m_belt

private

Definition at line 88 of file LeftistOrdering.h.

m_currCandidateIt

List<Candidate>::iterator ogdf::LeftistOrdering::m_currCandidateIt

private

Definition at line 91 of file LeftistOrdering.h.

m_cutEdges

NodeArray<int> ogdf::LeftistOrdering::m_cutEdges

private

Definition at line 97 of file LeftistOrdering.h.

m_cutFaces

NodeArray<int> ogdf::LeftistOrdering::m_cutFaces

private

Definition at line 94 of file LeftistOrdering.h.

m_marked

AdjEntryArray<bool> ogdf::LeftistOrdering::m_marked

private

Definition at line 100 of file LeftistOrdering.h.

---

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

• include/ogdf/planarlayout/LeftistOrdering.h