basics.h File Reference

Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem. More...

#include <abacus/master.h>
#include <ogdf/basic/Graph_d.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/cluster/ClusterGraphAttributes.h>

Go to the source code of this file.

Classes
struct	ogdf::nodePair
	Struct for storing the two corresponding nodes of an edge. More...
struct	ogdf::edgeValue
class	ogdf::BaseConstraint
	Basic constraint type. More...
Namespaces
namespace	ogdf
	The namespace for all OGDF objects.
Functions
std::ostream &	ogdf::operator<< (std::ostream &os, const nodePair &v)

---

Detailed Description

Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.

Basic classes for c-planarity computation.

Author:

Karsten Klein

License:

This file is part of the Open Graph Drawing Framework (OGDF). Copyright (C) 2005-2010

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