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/Module.h>
#include <ogdf/basic/Timeouter.h>
#include <ogdf/module/CPlanarSubgraphModule.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/internal/cluster/MaxCPlanar_Master.h>
#include <ogdf/external/abacus.h>

Go to the source code of this file.

Classes
class	ogdf::MaximumCPlanarSubgraph
	Exact computation of a maximum c-planar subgraph. More...
Namespaces
namespace	ogdf
	The namespace for all OGDF objects.
Defines
#define	OGDF_MAXIMUM_CPLANAR_SUBGRAPH_H

---

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). All rights reserved. See README.txt in the root directory of the OGDF installation 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

See also:

http://www.gnu.org/copyleft/gpl.html

Definition in file MaximumCPlanarSubgraph.h.

---

Define Documentation

#define OGDF_MAXIMUM_CPLANAR_SUBGRAPH_H

Definition at line 49 of file MaximumCPlanarSubgraph.h.