Interface for feasible upward planar subgraph algorithms.
More...
#include <ogdf/upward/FUPSModule.h>
Interface for feasible upward planar subgraph algorithms.
Definition at line 48 of file FUPSModule.h.
◆ FUPSModule()
ogdf::FUPSModule::FUPSModule |
( |
| ) |
|
|
inline |
Initializes a feasible upward planar subgraph module.
Definition at line 51 of file FUPSModule.h.
◆ ~FUPSModule()
virtual ogdf::FUPSModule::~FUPSModule |
( |
| ) |
|
|
inlinevirtual |
◆ call()
Computes a feasible upward planar subgraph of the input graph.
- Parameters
-
UPR | represents the feasible upward planar subgraph after the call. UPR has to be initialzed as a UpwardPlanRep of the input graph G and is modified. The subgraph is represented as an upward planar representation. |
delEdges | is the list of deleted edges which are deleted from the input graph in order to obtain the subgraph. The edges are edges of the original graph of UPR. |
- Returns
- the status of the result.
Definition at line 66 of file FUPSModule.h.
◆ doCall()
Computes a feasible upward planar subgraph of the input graph.
- Parameters
-
UPR | represents the feasible upward planar subgraph after the call. UPR has to be initialzed as a UpwardPlanRep of the input graph G and is modified. The subgraph is represented as an upward planar representation. |
delEdges | is the list of deleted edges which are deleted from the input graph in order to obtain the subgraph. The edges are edges of the original graph G. |
- Returns
- the status of the result.
Implemented in ogdf::FUPSSimple, and ogdf::MaximalFUPS.
◆ operator()()
Computes a upward planarized representation of the input graph (shorthand for call)
Definition at line 69 of file FUPSModule.h.
The documentation for this class was generated from the following file: