Inheritance diagram for ogdf::FUPSSimple:

Public Member Functions
	FUPSSimple ()
	Creates an instance of feasible subgraph algorithm.
	~FUPSSimple ()
void	runs (int nRuns)
	Sets the number of randomized runs to nRuns.
int	runs () const
	Returns the current number of randomized runs.
adjEntry	getAdjEntry (const CombinatorialEmbedding &Gamma, node v, face f)
	return a adjEntry of node v which right face is f. Be Carefully! The adjEntry is not always unique.
Protected Member Functions
virtual Module::ReturnType	doCall (UpwardPlanRep &UPR, List< edge > &delEdges)
	Computes a feasible upward planar subgraph of the input graph.
Private Member Functions
void	computeFUPS (UpwardPlanRep &UPR, List< edge > &delEdges)
void	getSpanTree (GraphCopy &GC, List< edge > &delEdges, bool random)
	Compute a (random) span tree of the input sT-Graph.
void	dfs_visit (const Graph &G, edge e, NodeArray< bool > &visited, EdgeArray< bool > &treeEdges, bool random)
bool	constructMergeGraph (GraphCopy &M, adjEntry adj_orig, const List< edge > &del_orig)
Private Attributes
int	m_nRuns
	The number of runs for randomization.

Detailed Description

Definition at line 57 of file FUPSSimple.h.

Constructor & Destructor Documentation

ogdf::FUPSSimple::FUPSSimple ( ) [inline]

Creates an instance of feasible subgraph algorithm.

Definition at line 61 of file FUPSSimple.h.

ogdf::FUPSSimple::~FUPSSimple ( ) [inline]

Definition at line 64 of file FUPSSimple.h.

void ogdf::FUPSSimple::computeFUPS	(	UpwardPlanRep &	UPR,
		List< edge > &	delEdges
	)		`[private]`

bool ogdf::FUPSSimple::constructMergeGraph	(	GraphCopy &	M,
		adjEntry	adj_orig,
		const List< edge > &	del_orig
	)		`[private]`

void ogdf::FUPSSimple::dfs_visit	(	const Graph &	G,
		edge	e,
		NodeArray< bool > &	visited,
		EdgeArray< bool > &	treeEdges,
		bool	random
	)		`[private]`

virtual Module::ReturnType ogdf::FUPSSimple::doCall	(	UpwardPlanRep &	UPR,
		List< edge > &	delEdges
	)		`[protected, virtual]`

Computes a feasible upward planar subgraph of the input graph.

Parameters:

UPR	represents the feasible upward planar subgraph after the call. UPR has to be initialzed as a UpwardPlanRep of the input connected graph G and is modified to obtain the upward planar subgraph. The subgraph is represented as an upward planar representation.
delEdges	is the deleted edges in order to obtain the subgraph. The edges are edges of the original graph G.

adjEntry ogdf::FUPSSimple::getAdjEntry	(	const CombinatorialEmbedding &	Gamma,
		node	v,
		face	f
	)		`[inline]`

return a adjEntry of node v which right face is f. Be Carefully! The adjEntry is not always unique.

Definition at line 81 of file FUPSSimple.h.

void ogdf::FUPSSimple::getSpanTree	(	GraphCopy &	GC,
		List< edge > &	delEdges,
		bool	random
	)		`[private]`

Compute a (random) span tree of the input sT-Graph.

void ogdf::FUPSSimple::runs ( int nRuns ) [inline]

Sets the number of randomized runs to nRuns.

Definition at line 70 of file FUPSSimple.h.

int ogdf::FUPSSimple::runs ( ) const [inline]

Returns the current number of randomized runs.

Definition at line 75 of file FUPSSimple.h.

The number of runs for randomization.

Definition at line 111 of file FUPSSimple.h.

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