Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
GeometricVertexInsertion.h
Go to the documentation of this file.
1
47#pragma once
49#include <ogdf/basic/Graph_d.h>
52
53namespace ogdf {
54
59public:
62
64
66 virtual void call(GraphAttributes& GA) override;
67
69
70 void setVertexOrder(List<node>* vertex_order) { m_vertex_order = vertex_order; }
71
76
77private:
79 VertexPositionModule* m_pos = nullptr;
80 List<node>* m_vertex_order = nullptr;
81 LayoutModule* m_initial_layout_module = nullptr;
82
84};
85
86}
Pure declaration header, find template implementation in Graph.h.
Declaration of class GraphAttributes which extends a Graph by additional attributes.
Declaration of interface for layout algorithms (class LayoutModule)
Optimal Vertex Position interface.
virtual void call(GraphAttributes &GA) override
The main call to the algorithm. GA should have nodeGraphics attributes enabled.
void setVertexOrder(List< node > *vertex_order)
GeometricVertexInsertion(Graph &_g)
Constructor, sets options to default values.
void setVertexPosition(VertexPositionModule *opt_pos)
void setInitialLayouter(ogdf::LayoutModule *initial_layout_module)
sets the method to compute the initial layout of the computed (planar) subgraph
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.