MaximumCPlanarSubgraph.h File Reference

Declaration of an exact c-planar subgraph algorithm, i.e., a maximum c-planar subgraph is computed using a branch and cut approach. More...

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/Stopwatch.h>
#include <ogdf/basic/basic.h>
#include <ogdf/cluster/CPlanarSubgraphModule.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/cluster/internal/MaxCPlanarMaster.h>
#include <ogdf/external/abacus.h>
#include <cstdint>
#include <sstream>
#include <string>

Go to the source code of this file.

Classes
class	abacus::StandardPool< BaseType, CoType >
	Standard pools. More...
class	ogdf::MaximumCPlanarSubgraph
	Exact computation of a maximum c-planar subgraph. More...

Namespaces
	abacus
	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declaration of an exact c-planar subgraph algorithm, i.e., a maximum c-planar subgraph is computed using a branch and cut approach.

Author

Karsten Klein

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 MaximumCPlanarSubgraph.h.