Loading [MathJax]/extensions/tex2jax.js

Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Loading...
Searching...
No Matches
EmbedderOptimalFlexDraw.h
Go to the documentation of this file.
1
32#pragma once
33
37
38#include <memory>
39
40namespace ogdf {
41
43
50public:
52
53 virtual void doCall(Graph& G, adjEntry& adjExternal) override;
54
59
61 void cost(EdgeArray<int>* cost) { m_cost = cost; }
62
63private:
64 std::unique_ptr<MinCostFlowModule<int>> m_minCostFlowComputer;
65
67
68 void createNetwork(node parent, node mu, int bends, NodeArray<int> cost[], Skeleton& skeleton,
71
72 void optimizeOverEmbeddings(StaticPlanarSPQRTree& T, node parent, node mu, int bends,
73 NodeArray<int> cost[], NodeArray<long long> embedding[]);
74
76 NodeArray<long long> embedding[], node parent, node mu);
77};
78
79}
Defines ogdf::EmbedderModule.
Definition of ogdf::MinCostFlowModule class template.
Declaration of class StaticPlanarSPQRTree.
Class for adjacency list elements.
Definition Graph_d.h:79
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Base class for embedder algorithms.
The algorithm computes a planar embedding with minimum cost.
void createNetwork(node parent, node mu, int bends, NodeArray< int > cost[], Skeleton &skeleton, EdgeArray< node > &edgeNode, Graph &N, EdgeArray< int > &upper, EdgeArray< int > &perUnitCost, NodeArray< int > &supply)
void setMinCostFlowComputer(MinCostFlowModule< int > *pMinCostFlowComputer)
Sets the module option to compute min-cost flow.
void cost(EdgeArray< int > *cost)
Sets bend costs for each edge.
virtual void doCall(Graph &G, adjEntry &adjExternal) override
Calls the embedder algorithm for graph G.
std::unique_ptr< MinCostFlowModule< int > > m_minCostFlowComputer
void optimizeOverEmbeddings(StaticPlanarSPQRTree &T, node parent, node mu, int bends, NodeArray< int > cost[], NodeArray< long long > embedding[])
void computePrincipalSplitComponentCost(StaticPlanarSPQRTree &T, NodeArray< int > cost[], NodeArray< long long > embedding[], node parent, node mu)
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Interface for min-cost flow algorithms.
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
Class for the representation of nodes.
Definition Graph_d.h:177
Skeleton graphs of nodes in an SPQR-tree.
Definition Skeleton.h:59
SPQR-trees of planar graphs.
#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.