Declaration of the CPlanarityMaster class for the Branch&Cut algorithm for c-planarity testing via an extension to complete connectivity. More...
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphCopy.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/Logger.h>
#include <ogdf/basic/basic.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/cluster/internal/CP_MasterBase.h>
#include <ogdf/cluster/internal/CPlanarEdgeVar.h>
#include <ogdf/cluster/internal/basics.h>
Go to the source code of this file.
Classes | |
class | ogdf::cluster_planarity::CPlanarityMaster |
Namespaces | |
abacus | |
ogdf | |
The namespace for all OGDF objects. | |
ogdf::cluster_planarity | |
Declaration of the CPlanarityMaster class for the Branch&Cut algorithm for c-planarity testing via an extension to complete connectivity.
This class is managing the optimization. Variables and initial constraints are generated and pools are initialized.
Definition in file CPlanarityMaster.h.