|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
65 : useTriBFS {useTriangulatingBFS}, treeHeightIterations(treeHeightIt + 1) { }
77 std::shared_ptr<BFSTreeClassical>
tree;
80 std::string name =
"LT";
84 if (treeHeightIterations > 1) {
94 virtual void makeTree();
110 edge chooseEdge()
const;
The namespace for all OGDF objects.
Includes declaration of graph class.
Computes planar separators according to Lipton and Tarjan 1979.
Abstract description of all planar separator algorithms.
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).
Data type for general directed graphs (adjacency list representation).
unsigned int treeHeightIterations
Basic declarations, included by all source files.
std::shared_ptr< BFSTreeClassical > tree
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Class for the representation of edges.
SeparatorLiptonTarjan(bool useTriangulatingBFS=false, unsigned int treeHeightIt=0)
Constructor.
std::string to_string(const std::function< std::ostream &(std::ostream &)> &func)
virtual std::string getSpecificName() const override
Returns the unique name of the core algorithm, to be combined with postprocessors later.
Declaration of base class of all planar separator algorithms.