Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

MaximalFUPS.h
Go to the documentation of this file.
1 
34 #pragma once
35 
36 #include <ogdf/basic/Graph.h>
37 #include <ogdf/basic/Module.h>
38 #include <ogdf/upward/FUPSModule.h>
39 
40 namespace ogdf {
41 class UpwardPlanRep;
42 template<class E>
43 class List;
44 
45 class MaximalFUPS : public FUPSModule {
46 public:
47  //constructor
49 
50 private:
51  int m_timelimit;
52 
53 protected:
54  Module::ReturnType doCall(UpwardPlanRep& UPR, List<edge>& delEdges) override;
55 
56 public:
57 #if 0
58  int computeMFUPS(GraphCopy &GC);
59 #endif
60  int getTimelimit() { return m_timelimit; }
61 
62  void setTimelimit(int timelimit) { m_timelimit = timelimit; }
63 };
64 
65 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
Graph.h
Includes declaration of graph class.
ogdf::MaximalFUPS::getTimelimit
int getTimelimit()
Definition: MaximalFUPS.h:60
ogdf::GraphCopy
Copies of graphs supporting edge splitting.
Definition: GraphCopy.h:391
ogdf::MaximalFUPS::doCall
Module::ReturnType doCall(UpwardPlanRep &UPR, List< edge > &delEdges) override
Computes a feasible upward planar subgraph of the input graph.
ogdf::List< edge >
ogdf::MaximalFUPS::setTimelimit
void setTimelimit(int timelimit)
Definition: MaximalFUPS.h:62
ogdf::MaximalFUPS::m_timelimit
int m_timelimit
Definition: MaximalFUPS.h:48
FUPSModule.h
Declaration of Feasible Upward Planar Subgraph (FUPS) Module, an interface for subgraph computation.
ogdf::MaximalFUPS
Definition: MaximalFUPS.h:45
ogdf::MaximalFUPS::MaximalFUPS
MaximalFUPS()
Definition: MaximalFUPS.h:48
ogdf::FUPSModule
Interface for feasible upward planar subgraph algorithms.
Definition: FUPSModule.h:48
ogdf::UpwardPlanRep
Upward planarized representations (of a connected component) of a graph.
Definition: UpwardPlanRep.h:57
Module.h
Declares base class for all module types.
ogdf::Module::ReturnType
ReturnType
The return type of a module.
Definition: Module.h:52