MaxCPlanarSub.h File Reference

Declaration of the sub-problem class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem Contains separation algorithms as well as primal heuristics. More...

#include <ogdf/basic/ArrayBuffer.h>
#include <ogdf/cluster/internal/MaxCPlanarMaster.h>
#include <ogdf/planarity/BoyerMyrvold.h>
#include <ogdf/lib/abacus/standardpool.h>
#include <ogdf/lib/abacus/sub.h>

Go to the source code of this file.

Classes
class	ogdf::cluster_planarity::MaxCPlanarSub

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.
namespace	ogdf::cluster_planarity

Detailed Description

Declaration of the sub-problem class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem Contains separation algorithms as well as primal heuristics.

Author

Mathias Jansen

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