ogdf::FUPSSimple Class Reference

#include <ogdf/upward/FUPSSimple.h>

Inheritance diagram for ogdf::FUPSSimple:

Public Member Functions
	FUPSSimple ()
	Creates an instance of feasible subgraph algorithm.
	~FUPSSimple ()
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.
int	runs () const
	Returns the current number of randomized runs.
void	runs (int nRuns)
	Sets the number of randomized runs to nRuns.
Public Member Functions inherited from ogdf::FUPSModule
	FUPSModule ()
	Initializes a feasible upward planar subgraph module.
virtual	~FUPSModule ()
ReturnType	call (UpwardPlanRep &UPR, List< edge > &delEdges)
	Computes a feasible upward planar subgraph of the input graph.
ReturnType	operator() (UpwardPlanRep &UPR, List< edge > &delEdges)
	Computes a upward planarized representation of the input graph (shorthand for call)
Public Member Functions inherited from ogdf::Module
	Module ()
	Initializes a module.
virtual	~Module ()

Protected Member Functions
virtual Module::ReturnType	doCall (UpwardPlanRep &UPR, List< edge > &delEdges) override
	Computes a feasible upward planar subgraph of the input graph.

Private Member Functions
void	computeFUPS (UpwardPlanRep &UPR, List< edge > &delEdges)
bool	constructMergeGraph (GraphCopy &M, adjEntry adj_orig, const List< edge > &del_orig)
void	dfs_visit (const Graph &G, edge e, NodeArray< bool > &visited, EdgeArray< bool > &treeEdges, bool random)
void	getSpanTree (GraphCopy &GC, List< edge > &delEdges, bool random)
	Compute a (random) span tree of the input sT-Graph.

Private Attributes
int	m_nRuns
	The number of runs for randomization.

Additional Inherited Members
Public Types inherited from ogdf::Module
enum class	ReturnType { Feasible , Optimal , NoFeasibleSolution , TimeoutFeasible , TimeoutInfeasible , Error }
	The return type of a module. More...
Static Public Member Functions inherited from ogdf::Module
static bool	isSolution (ReturnType ret)
	Returns true iff ret indicates that the module returned a feasible solution.

Detailed Description

Definition at line 39 of file FUPSSimple.h.

Constructor & Destructor Documentation

FUPSSimple()

ogdf::FUPSSimple::FUPSSimple ( )

inline

Creates an instance of feasible subgraph algorithm.

Definition at line 42 of file FUPSSimple.h.

~FUPSSimple()

ogdf::FUPSSimple::~FUPSSimple ( )

inline

Definition at line 45 of file FUPSSimple.h.

Member Function Documentation

computeFUPS()

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

private

constructMergeGraph()

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

private

Parameters

M	copy of the original graph, muss be embedded
adj_orig	the adjEntry of the original graph, which right face is the ext. Face and adj->theNode() is the source
del_orig	deleted edges

dfs_visit()

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

private

doCall()

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

overrideprotectedvirtual

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.

Returns

the status of the result.

Implements ogdf::FUPSModule.

getAdjEntry()

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 56 of file FUPSSimple.h.

getSpanTree()

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

private

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

runs() [1/2]

int ogdf::FUPSSimple::runs ( ) const

inline

Returns the current number of randomized runs.

Definition at line 53 of file FUPSSimple.h.

runs() [2/2]

void ogdf::FUPSSimple::runs ( int  nRuns )

inline

Sets the number of randomized runs to nRuns.

Definition at line 50 of file FUPSSimple.h.

Member Data Documentation

m_nRuns

int ogdf::FUPSSimple::m_nRuns

private

The number of runs for randomization.

Definition at line 84 of file FUPSSimple.h.

---

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

• include/ogdf/upward/FUPSSimple.h