ext/OGDF/ogdf/planarity/MaximalPlanarSubgraphSimple.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 MaximalPlanarSubgraphSimple
  11  *
  12  * \author Carsten Gutwenger
  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
  49 #ifndef OGDF_MAXIMAL_PLANAR_SUBGRAPH_SIMPLE_H
  50 #define OGDF_MAXIMAL_PLANAR_SUBGRAPH_SIMPLE_H
  51
  52
  53
  54
  55 #include <ogdf/module/PlanarSubgraphModule.h>
  56
  57
  58 namespace ogdf {
  59
  60 //---------------------------------------------------------
  61 // MaximalPlanarSubgraphSimple
  62 // implements a maximal planar subgraph algorithm using
  63 // planarity testing
  64 //---------------------------------------------------------
  65 class OGDF_EXPORT MaximalPlanarSubgraphSimple : public PlanarSubgraphModule
  66 {
  67 public:
  68         // construction
  69         MaximalPlanarSubgraphSimple() { }
  70         // destruction
  71         ~MaximalPlanarSubgraphSimple() { }
  72
  73
  74 protected:
  75         // computes set of edges delEdges, which have to be deleted
  76         // in order to get a planar subgraph; edges in preferedEdges
  77         // should be contained in planar subgraph
  78         ReturnType doCall(const Graph &G,
  79                 const List<edge> &preferedEdges,
  80                 List<edge> &delEdges,
  81                 const EdgeArray<int>  *pCost,
  82                 bool preferedImplyPlanar);
  83 };
  84
  85
  86 } // end namespace ogdf
  87
  88 #endif