43class StaticPlanarSPQRTree;
60 m_minCostFlowComputer.reset(pMinCostFlowComputer);
Defines ogdf::EmbedderModule.
Includes declaration of graph class.
Definition of ogdf::MinCostFlowModule class template.
Basic declarations, included by all source files.
Class for adjacency list elements.
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)
EmbedderOptimalFlexDraw()
EdgeArray< int > * m_cost
Data type for general directed graphs (adjacency list representation).
Interface for min-cost flow algorithms.
Class for the representation of nodes.
Skeleton graphs of nodes in an SPQR-tree.
SPQR-trees of planar graphs.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.