|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
43 class StaticPlanarSPQRTree;
56 virtual void doCall(
Graph& G,
adjEntry& adjExternal)
override;
60 m_minCostFlowComputer.reset(pMinCostFlowComputer);
The namespace for all OGDF objects.
The algorithm computes a planar embedding with minimum cost.
Includes declaration of graph class.
void setMinCostFlowComputer(MinCostFlowModule< int > *pMinCostFlowComputer)
Sets the module option to compute min-cost flow.
Class for adjacency list elements.
Interface for min-cost flow algorithms.
std::unique_ptr< MinCostFlowModule< int > > m_minCostFlowComputer
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
void cost(EdgeArray< int > *cost)
Sets bend costs for each edge.
SPQR-trees of planar graphs.
Base class for embedder algorithms.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Defines ogdf::EmbedderModule.
Skeleton graphs of nodes in an SPQR-tree.
Definition of ogdf::MinCostFlowModule class template.
EdgeArray< int > * m_cost
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.