Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
LongestPathCompaction.h
Go to the documentation of this file.
1
33#pragma once
34
36#include <ogdf/basic/tuples.h>
40
41namespace ogdf {
42
43template<class ATYPE>
44class CompactionConstraintGraph;
45
64public:
66 explicit LongestPathCompaction(bool tighten = true, int maxImprovementSteps = 0);
67
71
72
76
77 //
78 // options
79
81 void tighten(bool select) { m_tighten = select; }
82
84 bool tighten() const { return m_tighten; }
85
87 void maxImprovementSteps(int maxSteps) { m_maxImprovementSteps = maxSteps; }
88
90 int maxImprovementSteps() const { return m_maxImprovementSteps; }
91
92
93private:
95
97
99
100
101 // options
104
107};
108
109}
Declaration of class GridLayoutMapped which extends GridLayout by a grid mapping mechanism.
Declaration of orthogonal representation of planar graphs.
Declaration of a base class for planar representations of graphs and cluster graphs.
Declaration of class RoutingChannel which maintains required size of routing channels and separation,...
Represents a constraint graph used for compaction.
Extends GridLayout by a grid mapping mechanism.
Compaction algorithm using longest paths in the constraint graph.
void maxImprovementSteps(int maxSteps)
Sets the option max improvement steps.
void constructiveHeuristics(PlanRep &PG, OrthoRep &OR, const RoutingChannel< int > &rc, GridLayoutMapped &drawing)
Constructive heurisitic for orthogonal representations.
void applyLongestPaths(const CompactionConstraintGraph< int > &D, NodeArray< int > &pos)
SList< node > m_pseudoSources
The list of pseudo-sources.
int maxImprovementSteps() const
Returns the option max improvement steps.
int m_maxImprovementSteps
The maximal number of improvement steps.
void improvementHeuristics(PlanRep &PG, OrthoRep &OR, const RoutingChannel< int > &rc, GridLayoutMapped &drawing)
Improvement heurisitic for orthogonal drawings.
void moveComponents(const CompactionConstraintGraph< int > &D, NodeArray< int > &pos)
bool m_tighten
Tighten pseudo-components.
bool tighten() const
Returns the option tighten.
NodeArray< int > m_component
The pseudo component of a node.
void tighten(bool select)
Sets option tighten to select.
void computeCoords(const CompactionConstraintGraph< int > &D, NodeArray< int > &pos)
LongestPathCompaction(bool tighten=true, int maxImprovementSteps=0)
Creates an instance of the longest path compaction algorithm.
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
Orthogonal representation of an embedded graph.
Definition OrthoRep.h:219
Planarized representations (of a connected component) of a graph.
Definition PlanRep.h:57
Maintains input sizes for constructive compaction (size of routing channels, separation,...
Singly linked lists (maintaining the length of the list).
Definition SList.h:833
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.
Declaration and implementation of class Tuple2, Tuple3 and Tuple4.