125 int numberOfCrossings()
const {
133 double m_minx, m_maxx, m_miny, m_maxy, m_width,
m_height;
Declaration of interface for algorithms that arrange/pack layouts of connected components.
Declaration of interface for planar layout algorithms for UML diagrams (used in planarization approac...
Base class of algorithms that arrange/pack layouts of connected components.
Stores additional attributes of a clustered graph (like layout information).
Representation of clustered graphs.
Planarized representations for clustered graphs.
The cluster planarization layout algorithm.
virtual ~ClusterPlanarizationLayout()
Destruction.
virtual void call(Graph &G, ClusterGraphAttributes &acGraph, ClusterGraph &cGraph, bool simpleCConnect=true)
Calls cluster planarization layout with cluster-graph attributes acGraph.
double m_pageRatio
The page ratio.
double pageRatio() const
Returns the current page ratio (= desired width / height of layout).
std::unique_ptr< CCLayoutPackModule > m_packer
The packing algorithm.
void computeClusterPositions(ClusterPlanRep &CP, Layout drawing, HashArray< int, ClusterPosition > &CA)
void setPacker(CCLayoutPackModule *pPacker)
Sets the module option for the arrangement of connected components to pPacker.
int m_nCrossings
The number of crossings (not yet used!).
void setPlanarLayouter(LayoutClusterPlanRepModule *pPlanarLayouter)
Sets the module option for the planar layout algorithm to pPlanarLayouter.
void pageRatio(double ratio)
Sets the page ratio to ratio.
std::unique_ptr< LayoutClusterPlanRepModule > m_planarLayouter
The planar layouter.
ClusterPlanarizationLayout()
Creates an instance of cluster planarization layout.
virtual void call(Graph &G, ClusterGraphAttributes &acGraph, ClusterGraph &cGraph, EdgeArray< double > &edgeWeight, bool simpleCConnect=true)
Calls cluster planarization layout with cluster-graph attributes acGraph.
Dynamic arrays indexed with edges.
Data type for general directed graphs (adjacency list representation).
Indexed arrays using hashing for element access.
Interface for planar cluster layout algorithms.
Stores a layout of a graph (coordinates of nodes, bend points of edges).
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.