Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
MixedModelCrossingsBeautifierModule.h
Go to the documentation of this file.
1
33#pragma once
34
37
38namespace ogdf {
39
55public:
58
59 // destruction
61
62 /*
63 * \brief Calls the Mixed-Model crossings beautifier module for graph \p PG and grid layout \p gl.
64 *
65 * @param PG is the input graph.
66 * @param gl is the grid layout of \p PG.
67 */
68 void call(const PlanRep& PG, GridLayout& gl);
69
71 int numberOfCrossings() const { return m_nCrossings; }
72
73
74protected:
82 virtual void doCall(const PlanRep& PG, GridLayout& gl, const List<node>& L) = 0;
83
84private:
86
88};
89
91
96protected:
98 virtual void doCall(const PlanRep&, GridLayout&, const List<node>&) override { }
99};
100
101}
Declaration of class GridLayout.
Declaration of a base class for planar representations of graphs and cluster graphs.
Representation of a graph's grid layout.
Definition GridLayout.h:46
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Dummy implementation of Mixed-Model crossings beautifier.
virtual void doCall(const PlanRep &, GridLayout &, const List< node > &) override
Dummy implementation.
The base class for Mixed-Model crossings beautifier algorithms.
void call(const PlanRep &PG, GridLayout &gl)
int numberOfCrossings() const
Returns the number of processed crossings.
MixedModelCrossingsBeautifierModule()
Initializes the Mixed-Model crossings beautifier module.
virtual void doCall(const PlanRep &PG, GridLayout &gl, const List< node > &L)=0
Implements the crossings beautifier module.
Planarized representations (of a connected component) of a graph.
Definition PlanRep.h:57
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:91
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.