Includes declaration of graph class.
Basic declarations, included by all source files.
Representation of a graph's grid layout.
Doubly linked lists (maintaining the length of the list).
Dummy implementation of Mixed-Model crossings beautifier.
virtual void doCall(const PlanRep &, GridLayout &, const List< node > &) override
Dummy implementation.
The base class for Mixed-Model crossings beautifier algorithms.
void call(const PlanRep &PG, GridLayout &gl)
int numberOfCrossings() const
Returns the number of processed crossings.
MixedModelCrossingsBeautifierModule()
Initializes the Mixed-Model crossings beautifier module.
int m_nCrossings
the number of processed crossings.
virtual void doCall(const PlanRep &PG, GridLayout &gl, const List< node > &L)=0
Implements the crossings beautifier module.
virtual ~MixedModelCrossingsBeautifierModule()
Planarized representations (of a connected component) of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Declaration of memory manager for allocating small pieces of memory.
The namespace for all OGDF objects.