Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::PlanarSubgraphCactus< TCost > Class Template Reference

Maximum planar subgraph approximation algorithm by Calinescu et al. More...

#include <ogdf/planarity/PlanarSubgraphCactus.h>

+ Inheritance diagram for ogdf::PlanarSubgraphCactus< TCost >:

Public Member Functions

 PlanarSubgraphCactus ()
 
virtual PlanarSubgraphCactusclone () const override
 Returns a new instance of the planarization module with the same settings. More...
 
- Public Member Functions inherited from ogdf::PlanarSubgraphTriangles< TCost >
 PlanarSubgraphTriangles (bool onlyTriangles=false)
 Creates a planarization module based on triangle or diamond matching. More...
 
- Public Member Functions inherited from ogdf::PlanarSubgraphModule< TCost >
 PlanarSubgraphModule ()
 Initializes a planar subgraph module (default constructor). More...
 
ReturnType call (const Graph &G, const EdgeArray< TCost > &cost, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph. More...
 
ReturnType call (const Graph &G, const EdgeArray< TCost > &cost, List< edge > &delEdges)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph. More...
 
ReturnType call (const Graph &G, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph. More...
 
ReturnType call (const Graph &G, List< edge > &delEdges)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph. More...
 
ReturnType callAndDelete (GraphCopy &GC, const List< edge > &preferredEdges, List< edge > &delOrigEdges, bool preferredImplyPlanar=false)
 Makes GC planar by deleting edges. More...
 
ReturnType callAndDelete (GraphCopy &GC, List< edge > &delOrigEdges)
 Makes G planar by deleting edges. More...
 
unsigned int maxThreads () const
 Returns the maximal number of used threads. More...
 
void maxThreads (unsigned int n)
 Sets the maximal number of used threads to n. More...
 
ReturnType operator() (const Graph &G, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph. More...
 
ReturnType operator() (const Graph &G, List< edge > &delEdges)
 Returns the set of edges delEdges which have to be deleted to obtain the planar subgraph. More...
 
- Public Member Functions inherited from ogdf::Module
 Module ()
 Initializes a module. More...
 
virtual ~Module ()
 
- Public Member Functions inherited from ogdf::Timeouter
 Timeouter ()
 timeout is turned of by default More...
 
 Timeouter (bool t)
 timeout is turned off (false) or on (true) (with 0 second) More...
 
 Timeouter (const Timeouter &t)
 
 Timeouter (double t)
 timeout is set to the given value (seconds) More...
 
 ~Timeouter ()
 
bool isTimeLimit () const
 returns whether any time limit is set or not More...
 
Timeouteroperator= (const Timeouter &t)
 
double timeLimit () const
 returns the current time limit for the call More...
 
void timeLimit (bool t)
 shorthand to turn timelimit off or on (with 0 seconds) More...
 
void timeLimit (double t)
 sets the time limit for the call (in seconds); <0 means no limit. 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...
 
- Protected Member Functions inherited from ogdf::PlanarSubgraphTriangles< TCost >
virtual Module::ReturnType doCall (const Graph &graph, const List< edge > &, List< edge > &delEdges, const EdgeArray< TCost > *pCost, bool preferredImplyPlanar=false) override
 Computes the set of edges delEdges which have to be deleted to obtain the planar subgraph. More...
 
- Protected Attributes inherited from ogdf::Timeouter
double m_timeLimit
 Time limit for module calls (< 0 means no limit). More...
 

Detailed Description

template<typename TCost>
class ogdf::PlanarSubgraphCactus< TCost >

Maximum planar subgraph approximation algorithm by Calinescu et al.

The algorithm has an approximation factor of 7/18. Setting preferred edges is not supported. Weighted edges are heuristically respected but there is no approximation guarantee in the weighted case.

Definition at line 47 of file PlanarSubgraphCactus.h.

Constructor & Destructor Documentation

◆ PlanarSubgraphCactus()

template<typename TCost >
ogdf::PlanarSubgraphCactus< TCost >::PlanarSubgraphCactus ( )
inline

Definition at line 50 of file PlanarSubgraphCactus.h.

Member Function Documentation

◆ clone()

template<typename TCost >
virtual PlanarSubgraphCactus* ogdf::PlanarSubgraphCactus< TCost >::clone ( ) const
inlineoverridevirtual

Returns a new instance of the planarization module with the same settings.

Reimplemented from ogdf::PlanarSubgraphTriangles< TCost >.

Definition at line 52 of file PlanarSubgraphCactus.h.


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