ILPClusterPlanarity.h File Reference

Declaration of a c-planarity testing algorithm, based on a completely connected graph extension. More...

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/Stopwatch.h>
#include <ogdf/basic/basic.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/cluster/ClusterPlanarityModule.h>
#include <ogdf/cluster/internal/CP_MasterBase.h>
#include <ogdf/cluster/internal/CPlanarityMaster.h>
#include <ogdf/external/abacus.h>
#include <cstdint>
#include <iosfwd>
#include <string>

Go to the source code of this file.

Classes
class	ogdf::ILPClusterPlanarity
	C-planarity testing via completely connected graph extension. More...

Namespaces
namespace	abacus
namespace	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declaration of a c-planarity testing algorithm, based on a completely connected graph extension.

Author

Karsten Klein, Markus Chimani

License:

This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C)
See README.md in the OGDF root directory for details.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file ILPClusterPlanarity.h.