|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
60 SeparatorDual(
bool useTriangulatingBFS =
false,
unsigned int treeHeightIt = 0)
61 : useTriBFS {useTriangulatingBFS}, treeHeightIterations(treeHeightIt + 1) { }
64 std::string name =
"Dual";
68 if (treeHeightIterations > 1) {
78 virtual void makeTree()
override;
The namespace for all OGDF objects.
Includes declaration of graph class.
Computes planar separators according to Lipton and Tarjan 1979.
virtual std::string getSpecificName() const override
Returns the unique name of the core algorithm, to be combined with postprocessors later.
virtual double getMaxSeparatorSize(int n) const override
Provides the maximal separator size that this algorithm guarantees as a function of the number of nod...
Doubly linked lists (maintaining the length of the list).
Computes planar separators using the Dual of the graph.
Data type for general directed graphs (adjacency list representation).
Declaration of class SeparatorLiptonTarjan.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
unsigned int treeHeightIterations
SeparatorDual(bool useTriangulatingBFS=false, unsigned int treeHeightIt=0)
Constructor.
std::string to_string(const std::function< std::ostream &(std::ostream &)> &func)