89 m_acyclicMod.reset(acyclicMod);
92 int runs() {
return m_runs; }
94 void runs(
int n) { m_runs = n; }
Declaration of interface for acyclic subgraph algorithms.
Declaration of Feasible Upward Planar Subgraph (FUPS) Module, an interface for subgraph computation.
Declaration of the FUPSSimple.
declaration of class FixedEmbeddingInserterOld
Includes declaration of graph class.
Declaration of class GeedyCycleRemoval.
Declaration of interface for edge insertion algorithms.
Declaration of UpwardPlanarizer Module, an interface for upward planarization algorithms.
Basic declarations, included by all source files.
Base class of algorithms for computing a maximal acyclic subgraph.
Interface for feasible upward planar subgraph algorithms.
Edge insertion module that inserts each edge optimally into a fixed embedding.
Copies of graphs supporting edge splitting.
Greedy algorithm for computing a maximal acyclic subgraph.
ReturnType
The return type of a module.
Class for the representation of nodes.
Takes an acyclic connected non-upward-planar graph and planarizes it, i.e., we obtain an upward-plana...
void setInserter(UpwardEdgeInserterModule *pInserter)
Sets the module option for the edge insertion module.
SubgraphUpwardPlanarizer()
Creates an instance of subgraph planarizer.
void dfsMerge(const GraphCopy &GC, BCTree &BC, NodeArrayP< GraphCopy > &biComps, NodeArrayP< UpwardPlanRep > &uprs, UpwardPlanRep &UPR_res, node parent_BC, node current_BC, NodeArray< bool > &nodesDone)
traversion the BTree and merge the component to a common graph
std::unique_ptr< FUPSModule > m_subgraph
The upward planar subgraph algorithm.
std::unique_ptr< UpwardEdgeInserterModule > m_inserter
The edge insertion module.
void setSubgraph(FUPSModule *FUPS)
Sets the module option for the computation of the feasible upward planar subgraph.
std::unique_ptr< AcyclicSubgraphModule > m_acyclicMod
The acyclic subgraph module.
void merge(const GraphCopy &GC, UpwardPlanRep &UPR_res, const GraphCopy &block, UpwardPlanRep &UPR)
add UPR to UPR_res.
void setAcyclicSubgraphModule(AcyclicSubgraphModule *acyclicMod)
Sets the module option for acyclic subgraph module.
void constructComponentGraphs(BCTree &BC, NodeArrayP< GraphCopy > &biComps)
virtual ReturnType doCall(UpwardPlanRep &UPR, const EdgeArray< int > &cost, const EdgeArray< bool > &forbid) override
Computes an upward planarized representation of the input graph.
Upward planarized representations (of a connected component) of a graph.
Interface for upward planarization algorithms.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.