ext/OGDF/ogdf/cluster/CPlanarSubClusteredGraph.h

   1 /*
   2  * $Revision: 2566 $
   3  *
   4  * last checkin:
   5  *   $Author: gutwenger $
   6  *   $Date: 2012-07-07 23:10:08 +0200 (Sa, 07. Jul 2012) $
   7  ***************************************************************/
   8
   9 /** \file
  10  * \brief Declaration of CPlanarSubClusteredGraph class.
  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_CPLANAR_SUBCLUSTERED_GRAPH_H
  49 #define OGDF_CPLANAR_SUBCLUSTERED_GRAPH_H
  50
  51
  52 #include <ogdf/cluster/ClusterPlanRep.h>
  53 #include <ogdf/internal/cluster/CPlanarSubClusteredST.h>
  54
  55 namespace ogdf {
  56
  57 //! Constructs a c-planar subclustered graph of the input on base of a spanning tree
  58 class OGDF_EXPORT CPlanarSubClusteredGraph
  59 {
  60
  61 public:
  62
  63         CPlanarSubClusteredGraph() { }
  64
  65         virtual void call(const ClusterGraph& CG, EdgeArray<bool>& inSub);
  66
  67         virtual void call(
  68                 const ClusterGraph& CGO,
  69                 EdgeArray<bool>& inSub,
  70                 List<edge>& leftOver);
  71
  72         //! Uses \a edgeWeight to compute clustered planar subgraph
  73         virtual void call(
  74                 const ClusterGraph& CGO,
  75                 EdgeArray<bool>& inSub,
  76                 List<edge>& leftOver,
  77                 EdgeArray<double>& edgeWeight);
  78
  79 private:
  80
  81         //****************************************************
  82         //data fields
  83
  84         //store status of original edge: in subclustered graph?
  85         //also used to check spanning tree
  86         EdgeArray<int> m_edgeStatus;
  87
  88 };//cplanarsubclusteredgraph
  89
  90 } // end namespace ogdf
  91
  92
  93 #endif