Open
Graph Drawing
Framework

 v.2012.05
 

Cluster_ChunkConnection.h File Reference

implementation of initial cut-constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem. More...

Go to the source code of this file.

Classes

class  ogdf::ChunkConnection

Namespaces

namespace  ogdf
 The namespace for all OGDF objects.

Detailed Description

implementation of initial cut-constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.

A feasible ILP solution has to imply a completely connected, planar Sub-Clustergraph. For each cluster that is not connected, additional connection edges have to be inserted between the chunks of the cluster, to obtain c-connectivity. Thus, initial constraints are added that guarantee initial c-connectivity, if the number of chunks is at most 3. If some cluster consists of more than 3 chunks, additional constraints have to be separated during the optimization.

Author:
Mathias Jansen
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 Cluster_ChunkConnection.h.