|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
67 std::shared_ptr<ArrayBFSTree>
tree;
88 std::string name =
"DualFC";
89 if (useTriangulatingBFS) {
The namespace for all OGDF objects.
Includes declaration of graph class.
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
Maximum separator size depends on diameter of graph, so returns -1.
Computes planar separators by applying the Fundamental Cycle Lemma directly, without trying tree leve...
Doubly linked lists (maintaining the length of the list).
Data type for general directed graphs (adjacency list representation).
Declaration of class SeparatorLiptonTarjanFC.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Computes planar separators using Fundamental Cycles.
SeparatorDualFC(bool useTriBFS=false)
Constructor.
std::shared_ptr< ArrayBFSTree > tree