Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
TriconnectedShellingOrder.h
Go to the documentation of this file.
1
34#pragma once
35
37
38namespace ogdf {
39
43public:
44 TriconnectedShellingOrder() { m_baseRatio = 0.33; }
45
46protected:
47 // does the actual computation; must be overridden by derived classes
48 // the computed order is returned in partition
49 virtual void doCall(const Graph& G, adjEntry adj, List<ShellingOrderSet>& partition) override;
50};
51
52}
Declares the base class ShellingOrderModule for modules that compute a shelling order of a graph.
Class for adjacency list elements.
Definition Graph_d.h:79
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Base class for modules that compute a shelling order of a graph.
Computation of a shelling order for a triconnected and simple (no multi-edges, no self-loops) planar ...
virtual void doCall(const Graph &G, adjEntry adj, List< ShellingOrderSet > &partition) override
This pure virtual function does the actual computation.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
The namespace for all OGDF objects.