ext/OGDF/ogdf/planarity/MaximumPlanarSubgraph.h

   1 /*
   2  * $Revision: 2523 $
   3  *
   4  * last checkin:
   5  *   $Author: gutwenger $
   6  *   $Date: 2012-07-02 20:59:27 +0200 (Mon, 02 Jul 2012) $
   7  ***************************************************************/
   8
   9 /** \file
  10  * \brief Declaration of class MaximumPlanarSubgraph.
  11  *
  12  * \author Karsten Klein
  13  *
  14  * \par License:
  15  * This file is part of the Open Graph Drawing Framework (OGDF).
  16  *
  17  * \par
  18  * Copyright (C)<br>
  19  * See README.txt in the root directory of the OGDF installation for details.
  20  *
  21  * \par
  22  * This program is free software; you can redistribute it and/or
  23  * modify it under the terms of the GNU General Public License
  24  * Version 2 or 3 as published by the Free Software Foundation;
  25  * see the file LICENSE.txt included in the packaging of this file
  26  * for details.
  27  *
  28  * \par
  29  * This program is distributed in the hope that it will be useful,
  30  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  31  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  32  * GNU General Public License for more details.
  33  *
  34  * \par
  35  * You should have received a copy of the GNU General Public
  36  * License along with this program; if not, write to the Free
  37  * Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  38  * Boston, MA 02110-1301, USA.
  39  *
  40  * \see  http://www.gnu.org/copyleft/gpl.html
  41  ***************************************************************/
  42
  43
  44 #ifdef _MSC_VER
  45 #pragma once
  46 #endif
  47
  48 #ifndef OGDF_MAXIMUM_PLANAR_SUBGRAPH_H
  49 #define OGDF_MAXIMUM_PLANAR_SUBGRAPH_H
  50
  51 #include <ogdf/basic/Module.h>
  52 #include <ogdf/basic/Timeouter.h>
  53
  54 #include <ogdf/module/PlanarSubgraphModule.h>
  55 #include <ogdf/cluster/ClusterGraph.h>
  56
  57 #include <ogdf/external/abacus.h>
  58
  59 namespace ogdf {
  60
  61 //--------------------------------------------------------------------------
  62 //MaximumPlanarSubgraph
  63 //Exact computation of a maximum planar subgraph
  64 //--------------------------------------------------------------------------
  65 class OGDF_EXPORT MaximumPlanarSubgraph : public PlanarSubgraphModule
  66 {
  67
  68 #ifndef USE_ABACUS
  69 protected:
  70     virtual ReturnType doCall(const Graph &G,
  71             const List<edge> &preferedEdges,
  72             List<edge> &delEdges,
  73             const EdgeArray<int>  *pCost,
  74             bool preferedImplyPlanar)
  75     { THROW_NO_ABACUS_EXCEPTION; return retError; }
  76 };
  77 #else // Use_ABACUS
  78
  79 public:
  80     // Construction
  81     MaximumPlanarSubgraph() {}
  82     // Destruction
  83     virtual ~MaximumPlanarSubgraph() {}
  84
  85 protected:
  86     // Implements the Planar Subgraph interface.
  87     // For the given graph \a G, a clustered graph with only
  88     // a single root cluster is generated.
  89     // Computes set of edges delEdges, which have to be deleted
  90     // in order to get a planar subgraph; edges in preferredEdges
  91     // should be contained in planar subgraph.
  92     // Status: pCost and preferredEdges are ignored in current implementation.
  93     virtual ReturnType doCall(const Graph &G,
  94             const List<edge> &preferredEdges,
  95             List<edge> &delEdges,
  96             const EdgeArray<int>  *pCost,
  97             bool preferredImplyPlanar);
  98 };
  99
 100 #endif // USE_ABACUS
 101
 102 } //end namespace ogdf
 103
 104
 105 #endif // OGDF_MAXIMUM_PLANAR_SUBGRAPH_H