ext/OGDF/ogdf/layered/SplitHeuristic.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 SplitHeuristic.
  11  *
  12  * \author Andrea Wagner
  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 #ifdef _MSC_VER
  44 #pragma once
  45 #endif
  46
  47 #ifndef OGDF_SPLIT_HEURISTIC_H
  48 #define OGDF_SPLIT_HEURISTIC_H
  49
  50
  51 #include <ogdf/basic/EdgeArray.h>
  52 #include <ogdf/layered/CrossingsMatrix.h>
  53 #include <ogdf/simultaneous/TwoLayerCrossMinSimDraw.h>
  54
  55 namespace ogdf {
  56
  57
  58 //! The split heuristic for 2-layer crossing minimization.
  59 class OGDF_EXPORT SplitHeuristic : public TwoLayerCrossMinSimDraw
  60 {
  61 public:
  62         //! Initializes crossing minimization for hierarchy \a H.
  63         void init (const Hierarchy &H);
  64
  65         //! Calls the split heuristic for level \a L.
  66         void call (Level &L);
  67
  68         //! Calls the median heuristic for level \a L (simultaneous drawing).
  69         void call (Level &L, const EdgeArray<unsigned int> *edgeSubGraph);
  70
  71         //! Does some clean-up after calls.
  72         void cleanup ();
  73
  74 private:
  75         CrossingsMatrix *m_cm;
  76         Array<node> buffer;
  77
  78         void recCall(Level&, int low, int high);
  79 };
  80
  81 }// end namespace ogdf
  82
  83 #endif