Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

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

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. More...
 

Private Attributes

int m_nRuns
 The number of runs for randomization. More...
 

Additional Inherited Members

- Public Types inherited from ogdf::Module
enum  ReturnType { ReturnType::Feasible, ReturnType::Optimal, ReturnType::NoFeasibleSolution, ReturnType::TimeoutFeasible, ReturnType::TimeoutInfeasible, ReturnType::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. More...
 

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

◆ ~FUPSSimple()

ogdf::FUPSSimple::~FUPSSimple ( )
inline

Definition at line 46 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

◆ 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
UPRrepresents 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.
delEdgesis 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 63 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 57 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 52 of file FUPSSimple.h.

Member Data Documentation

◆ m_nRuns

int ogdf::FUPSSimple::m_nRuns
private

The number of runs for randomization.

Definition at line 95 of file FUPSSimple.h.


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