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
36#include <ogdf/basic/Graph.h>
37#include <ogdf/basic/Module.h>
39
40namespace ogdf {
41class UpwardPlanRep;
42template<class E>
43class List;
44
45class MaximalFUPS : public FUPSModule {
46public:
47 //constructor
49
50private:
52
53protected:
55
56public:
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}
Declaration of Feasible Upward Planar Subgraph (FUPS) Module, an interface for subgraph computation.
Includes declaration of graph class.
Declares base class for all module types.
Interface for feasible upward planar subgraph algorithms.
Definition FUPSModule.h:48
Copies of graphs supporting edge splitting.
Definition GraphCopy.h:390
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
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:62
ReturnType
The return type of a module.
Definition Module.h:52
Upward planarized representations (of a connected component) of a graph.
The namespace for all OGDF objects.