Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
GeometricEdgeInsertion.h
Go to the documentation of this file.
1
46#pragma once
47
48#include <ogdf/basic/Array.h>
49#include <ogdf/basic/Graph_d.h>
52
53namespace ogdf {
54
56public:
59
61
63 virtual void call(GraphAttributes& GA) override;
64
67
70 m_edge_set = edge_set;
71 //m_hidden_edges = hidden_edge_set;
72 }
73
78
79protected:
80private:
82 VertexPositionModule* m_pos = nullptr;
83 LayoutModule* m_initial_layout_module = nullptr;
84
85 List<edge>* m_edge_set = nullptr;
86
87
89};
90
91}
Declaration and implementation of Array class and Array algorithms.
Pure declaration header, find template implementation in Graph.h.
Declaration of interface for layout algorithms (class LayoutModule)
Optimal Vertex Position interface.
void setHiddenEdgeSet(List< edge > *edge_set)
sets the set of edges that have to reinserted
void setVertexPosition(VertexPositionModule *opt_pos)
sets the routine the compute the new position of a vertex
void setInitialLayouter(ogdf::LayoutModule *initial_layout_module)
sets the method to compute the initial layout of the computed (planar) subgraph
GeometricEdgeInsertion(Graph &_g)
Constructor, sets options to default values.
virtual void call(GraphAttributes &GA) override
The main call to the algorithm. GA should have nodeGraphics attributes enabled.
Stores additional attributes of a graph (like layout information).
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Interface of general layout algorithms.
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Interface for computing a good / optimal vertex position.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
#define OGDF_NEW_DELETE
Makes the class use OGDF's memory allocator.
Definition memory.h:84
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.