Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
BiconnectedShellingOrder.h
Go to the documentation of this file.
1
34#pragma once
35
37
38namespace ogdf {
39
47public:
49 BiconnectedShellingOrder() { m_baseRatio = 0.33; }
50
51protected:
53 virtual void doCall(const Graph& G, adjEntry adj, List<ShellingOrderSet>& partition) override;
54};
55
56}
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
Computation of the shelling order for biconnected graphs.
virtual void doCall(const Graph &G, adjEntry adj, List< ShellingOrderSet > &partition) override
The actual implementation of the module call.
BiconnectedShellingOrder()
Creates a biconnected shelling order module.
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.
#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.