Declaration of Feasible Upward Planar Subgraph (FUPS) Module, an interface for subgraph computation.
Interface for feasible upward planar subgraph algorithms.
Copies of graphs supporting edge splitting.
Doubly linked lists (maintaining the length of the list).
Module::ReturnType doCall(UpwardPlanRep &UPR, List< edge > &delEdges) override
Computes a feasible upward planar subgraph of the input graph.
void setTimelimit(int timelimit)
ReturnType
The return type of a module.
Upward planarized representations (of a connected component) of a graph.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.