Base class for modules that compute a shelling order of a graph.
More...
#include <ogdf/planarlayout/ShellingOrderModule.h>
Base class for modules that compute a shelling order of a graph.
Definition at line 44 of file ShellingOrderModule.h.
◆ ~ShellingOrderModule()
| virtual ogdf::ShellingOrderModule::~ShellingOrderModule |
( |
| ) |
|
|
inlinevirtual |
◆ baseRatio() [1/2]
| double ogdf::ShellingOrderModule::baseRatio |
( |
| ) |
const |
|
inline |
◆ baseRatio() [2/2]
| void ogdf::ShellingOrderModule::baseRatio |
( |
double |
x | ) |
|
|
inline |
◆ call()
Computes a shelling order of an embedded graph G such that adj lies on the external face.
- Parameters
-
| G | is the input graph; G must represent a combinatorial embedding. |
| order | is assigned the shelling order. |
| adj | is an adjacency entry on the external face; if adj is 0, a suitable external face is chosen. |
◆ callLeftmost()
Computes a lefmost shelling order of an embedded graph G such that adj lies on the external face.
- Parameters
-
| G | is the input graph; G must represent a combinatorial embedding. |
| order | is assigned the shelling order. |
| adj | is an adjacency entry on the external face; if adj is 0, a suitable external face is chosen. |
◆ doCall()
This pure virtual function does the actual computation.
A derived class must implement this method. It is called with the embedded graph and an adjacency entry describing the external face, and must return the computed order in partition.
- Parameters
-
| G | is the embedded input graph. |
| adj | is an adjacency entry on the external face. |
| partition | returns the coputed shelling order. |
Implemented in ogdf::BiconnectedShellingOrder, and ogdf::TriconnectedShellingOrder.
◆ m_baseRatio
| double ogdf::ShellingOrderModule::m_baseRatio |
|
protected |
The documentation for this class was generated from the following file: