Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

BiconnectedShellingOrder.h
Go to the documentation of this file.
1 
34 #pragma once
35 
36 #include <ogdf/basic/Graph.h>
37 #include <ogdf/basic/basic.h>
39 
40 namespace ogdf {
41 class ShellingOrderSet;
42 template<class E>
43 class List;
44 
52 public:
54  BiconnectedShellingOrder() { m_baseRatio = 0.33; }
55 
56 protected:
58  virtual void doCall(const Graph& G, adjEntry adj, List<ShellingOrderSet>& partition) override;
59 };
60 
61 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
ShellingOrderModule.h
Declares the base class ShellingOrderModule for modules that compute a shelling order of a graph.
Graph.h
Includes declaration of graph class.
ogdf::ShellingOrderModule
Base class for modules that compute a shelling order of a graph.
Definition: ShellingOrderModule.h:48
ogdf::AdjElement
Class for adjacency list elements.
Definition: Graph_d.h:142
ogdf::BiconnectedShellingOrder::BiconnectedShellingOrder
BiconnectedShellingOrder()
Creates a biconnected shelling order module.
Definition: BiconnectedShellingOrder.h:54
ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition: DfsMakeBiconnected.h:40
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:869
basic.h
Basic declarations, included by all source files.
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::BiconnectedShellingOrder
Computation of the shelling order for biconnected graphs.
Definition: BiconnectedShellingOrder.h:51