Pure declaration header, find template implementation in Graph.h.
Declaration of interface for grid layout algorithms.
Declaration of doubly linked lists and iterators.
Class for adjacency list elements.
Dynamic arrays indexed with edges.
Copies of graphs supporting edge splitting.
Data type for general directed graphs (adjacency list representation).
Representation of a graph's grid layout.
Doubly linked lists (maintaining the length of the list).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
Base class for planar grid layout algorithms.
The class SchnyderLayout represents the layout algorithm by Schnyder [Sch90].
void schnyderEmbedding(GraphCopy &GC, GridLayout &gridLayout, adjEntry adjExternal)
void setCombinatorialObjects(CombinatorialObjects combinatorialObjects)
Sets the type of combinatorial objects whose number corresponds to the node coordinates.
void contract(Graph &G, node a, node b, node c, List< node > &L)
CombinatorialObjects m_combinatorialObjects
Determines how the barycentric coordinates of each node are computed.
void subtreeSizes(EdgeArray< int > &rValues, int i, node r, NodeArray< int > &size)
CombinatorialObjects
Each node in a Schnyder wood splits the graph into three regions.
void realizer(GraphCopy &G, const List< node > &L, node a, node b, node c, EdgeArray< int > &rValues, GraphCopy &T)
CombinatorialObjects getCombinatorialObjects()
Returns the type of combinatorial objects whose number corresponds to the node coordinates.
virtual void doCall(const Graph &G, adjEntry adjExternal, GridLayout &gridLayout, IPoint &boundingBox, bool fixEmbedding) override
Implements the algorithm call.
void prefixSum(EdgeArray< int > &rValues, int i, node r, const NodeArray< int > &val, NodeArray< int > &sum)
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.