|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
89 m_acyclicMod.reset(acyclicMod);
92 int runs() {
return m_runs; }
94 void runs(
int n) { m_runs = n; }
The namespace for all OGDF objects.
Declaration of class GeedyCycleRemoval.
std::unique_ptr< UpwardEdgeInserterModule > m_inserter
The edge insertion module.
Includes declaration of graph class.
declaration of class FixedEmbeddingInserterOld
Takes an acyclic connected non-upward-planar graph and planarizes it, i.e., we obtain an upward-plana...
Greedy algorithm for computing a maximal acyclic subgraph.
void setAcyclicSubgraphModule(AcyclicSubgraphModule *acyclicMod)
Sets the module option for acyclic subgraph module.
Declaration of interface for edge insertion algorithms.
Copies of graphs supporting edge splitting.
Edge insertion module that inserts each edge optimally into a fixed embedding.
Declaration of the FUPSSimple.
void setSubgraph(FUPSModule *FUPS)
Sets the module option for the computation of the feasible upward planar subgraph.
void setInserter(UpwardEdgeInserterModule *pInserter)
Sets the module option for the edge insertion module.
Declaration of interface for acyclic subgraph algorithms.
std::unique_ptr< AcyclicSubgraphModule > m_acyclicMod
The acyclic subgraph module.
RegisteredArray for nodes, edges and adjEntries of a graph.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Declaration of Feasible Upward Planar Subgraph (FUPS) Module, an interface for subgraph computation.
Base class of algorithms for computing a maximal acyclic subgraph.
SubgraphUpwardPlanarizer()
Creates an instance of subgraph planarizer.
Declaration of UpwardPlanarizer Module, an interface for upward planarization algorithms.
Interface for feasible upward planar subgraph algorithms.
Interface for upward planarization algorithms.
Upward planarized representations (of a connected component) of a graph.
std::unique_ptr< FUPSModule > m_subgraph
The upward planar subgraph algorithm.
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.