#include <ogdf/hypergraph/HypergraphLayout.h>
Definition at line 61 of file HypergraphLayout.h.
◆ Profile
Final appearance is driven by given profile.
Enumerator |
---|
Normal | |
ElectricCircuit | |
Definition at line 64 of file HypergraphLayout.h.
◆ HypergraphLayoutES()
ogdf::HypergraphLayoutES::HypergraphLayoutES |
( |
| ) |
|
◆ ~HypergraphLayoutES()
virtual ogdf::HypergraphLayoutES::~HypergraphLayoutES |
( |
| ) |
|
|
inlinevirtual |
◆ applyProfile()
◆ call()
Computes a layout of hypergraph given by HA
.
This method is the actual algorithm call and must be implemented by derived classes.
- Parameters
-
HA | is the input hypergraph attributes class. |
Implements ogdf::HypergraphLayoutModule.
◆ crossings()
int ogdf::HypergraphLayoutES::crossings |
( |
| ) |
const |
|
inline |
◆ insertShell()
◆ layout()
◆ operator=()
◆ packAllCC()
◆ ratio()
double ogdf::HypergraphLayoutES::ratio |
( |
| ) |
const |
|
inline |
Returns the ratio between width and height of a drawing.
Definition at line 114 of file HypergraphLayout.h.
◆ removeShell()
void ogdf::HypergraphLayoutES::removeShell |
( |
PlanRep & |
planarRep, |
|
|
NodePair & |
st |
|
) |
| |
|
private |
◆ setConstraintIO()
void ogdf::HypergraphLayoutES::setConstraintIO |
( |
bool |
pConstraintIO | ) |
|
|
inline |
◆ setCrossingMinimizationModule()
Sets the module option for crossing minimization.
The crossing minimization module minimizes the crossings of a hypergraph in an edge standard representation.
Definition at line 145 of file HypergraphLayout.h.
◆ setEmbeddingModule()
void ogdf::HypergraphLayoutES::setEmbeddingModule |
( |
EmbedderModule * |
pEmbeddingModule | ) |
|
|
inline |
Sets the module option for embedding.
When a planarized edge representation of a hypergraph in computed, we have to found a way how to embed it (ie. find faces).
Definition at line 155 of file HypergraphLayout.h.
◆ setPlanarLayoutModule()
void ogdf::HypergraphLayoutES::setPlanarLayoutModule |
( |
LayoutPlanRepModule * |
pPlanarLayoutModule | ) |
|
|
inline |
Sets the module option for the planar layout.
Crossing minimization produces a planar representation of a hypergraph such that all crossings are replaced by additional dummy nodes. This is in fact a planar graph and hence it can be drawn quite easily by any planar layout algorithm.
Definition at line 135 of file HypergraphLayout.h.
◆ setProfile()
void ogdf::HypergraphLayoutES::setProfile |
( |
Profile |
pProfile | ) |
|
|
inline |
◆ m_constraintIO
bool ogdf::HypergraphLayoutES::m_constraintIO |
|
private |
Defines whether a drawing IO constraint is desired or not.
Definition at line 74 of file HypergraphLayout.h.
◆ m_constraintPorts
bool ogdf::HypergraphLayoutES::m_constraintPorts |
|
private |
Defines whether inputs and outputs are placed on different "sides".
Definition at line 78 of file HypergraphLayout.h.
◆ m_crossingMinimizationModule
◆ m_crossings
int ogdf::HypergraphLayoutES::m_crossings |
|
private |
◆ m_embeddingModule
std::unique_ptr<EmbedderModule> ogdf::HypergraphLayoutES::m_embeddingModule |
|
private |
◆ m_planarLayoutModule
◆ m_profile
Profile ogdf::HypergraphLayoutES::m_profile |
|
private |
Defines the profile of the layout (eg. Electric Circuit).
Definition at line 81 of file HypergraphLayout.h.
◆ m_ratio
double ogdf::HypergraphLayoutES::m_ratio |
|
private |
The documentation for this class was generated from the following file: