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
36#include <ogdf/basic/Graph.h>
37#include <ogdf/basic/basic.h>
39
40namespace ogdf {
41class ShellingOrderSet;
42template<class E>
43class List;
44
52public:
54 BiconnectedShellingOrder() { m_baseRatio = 0.33; }
55
56protected:
58 virtual void doCall(const Graph& G, adjEntry adj, List<ShellingOrderSet>& partition) override;
59};
60
61}
Includes declaration of graph class.
Declares the base class ShellingOrderModule for modules that compute a shelling order of a graph.
Basic declarations, included by all source files.
Class for adjacency list elements.
Definition Graph_d.h:143
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:866
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
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 dynamic library (shared object / DLL),...
Definition config.h:117
The namespace for all OGDF objects.