Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
MaximalFUPS.h
Go to the documentation of this file.
1
34#pragma once
35
37
38namespace ogdf {
39
40class MaximalFUPS : public FUPSModule {
41public:
42 //constructor
44
45private:
47
48protected:
50
51public:
52#if 0
54#endif
55 int getTimelimit() { return m_timelimit; }
56
58};
59
60}
Declaration of Feasible Upward Planar Subgraph (FUPS) Module, an interface for subgraph computation.
Interface for feasible upward planar subgraph algorithms.
Definition FUPSModule.h:43
Copies of graphs supporting edge splitting.
Definition GraphCopy.h:254
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Module::ReturnType doCall(UpwardPlanRep &UPR, List< edge > &delEdges) override
Computes a feasible upward planar subgraph of the input graph.
void setTimelimit(int timelimit)
Definition MaximalFUPS.h:57
ReturnType
The return type of a module.
Definition Module.h:50
Upward planarized representations (of a connected component) of a graph.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.