Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

TriconnectedShellingOrder.h
Go to the documentation of this file.
1 
34 #pragma once
35 
37 
38 namespace ogdf {
39 
43 public:
44  TriconnectedShellingOrder() { m_baseRatio = 0.33; }
45 
46 protected:
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 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ShellingOrderModule.h
Declares the base class ShellingOrderModule for modules that compute a shelling order of a graph.
ogdf::ShellingOrderModule
Base class for modules that compute a shelling order of a graph.
Definition: ShellingOrderModule.h:44
ogdf::AdjElement
Class for adjacency list elements.
Definition: Graph_d.h:135
ogdf::TriconnectedShellingOrder
Computation of a shelling order for a triconnected and simple (no multi-edges, no self-loops) planar ...
Definition: TriconnectedShellingOrder.h:42
ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition: List.h:42
ogdf::TriconnectedShellingOrder::TriconnectedShellingOrder
TriconnectedShellingOrder()
Definition: TriconnectedShellingOrder.h:44
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101