Pure declaration header, find template implementation in Graph.h.
Declaration of interface for grid layout algorithms.
Class for adjacency list elements.
The class FPPLayout represents the layout algorithm by de Fraysseix, Pach, Pollack [DPP90].
void computeOrder(const GraphCopy &G, NodeArray< int > &num, NodeArray< adjEntry > &e_wp, NodeArray< adjEntry > &e_wq, adjEntry e_12, adjEntry e_2n, adjEntry e_n1)
void computeCoordinates(const GraphCopy &G, IPoint &boundingBox, GridLayout &gridLayout, NodeArray< int > &num, NodeArray< adjEntry > &e_wp, NodeArray< adjEntry > &e_wq)
virtual void doCall(const Graph &G, adjEntry adjExternal, GridLayout &gridLayout, IPoint &boundingBox, bool fixEmbedding) override
Implements the algorithm call.
Copies of graphs supporting edge splitting.
Data type for general directed graphs (adjacency list representation).
Representation of a graph's grid layout.
Dynamic arrays indexed with nodes.
Base class for planar grid layout algorithms.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.