ext/OGDF/src/planarlayout/ShellingOrder.cpp

   1 /*
   2  * $Revision: 2554 $
   3  *
   4  * last checkin:
   5  *   $Author: gutwenger $
   6  *   $Date: 2012-07-06 11:39:38 +0200 (Fr, 06. Jul 2012) $
   7  ***************************************************************/
   8
   9 /** \file
  10  * \brief Implements class ShellingOrder.
  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 #include <ogdf/planarlayout/ShellingOrder.h>
  44 #include <ogdf/basic/BoundedStack.h>
  45 #include <ogdf/basic/SList.h>
  46
  47
  48 namespace ogdf {
  49
  50
  51 void ShellingOrder::init(const Graph &G, const List<ShellingOrderSet> &partition)
  52 {
  53         m_pGraph = &G;
  54         m_V.init(1,partition.size());
  55         m_rank.init(G);
  56
  57         int i = 1;
  58         ListConstIterator<ShellingOrderSet> it;
  59         for(it = partition.begin(); it.valid(); ++it)
  60         {
  61                 const ShellingOrderSet &S = *it;
  62                 for(int j = 1; j <= S.len(); ++j)
  63                         m_rank[S[j]] = i;
  64
  65                 m_V[i++] = *it;
  66         }
  67 }
  68
  69
  70 void ShellingOrder::initLeftmost(
  71         const Graph &G,
  72         const List<ShellingOrderSet> &partition)
  73 {
  74         m_pGraph = &G;
  75         m_V.init(1,partition.size());
  76         m_rank.init(G);
  77
  78         NodeArray<SListPure<const ShellingOrderSet *> > crSets(G);
  79         BoundedStack<node> outerfaceStack(G.numberOfNodes());
  80
  81         int i, j;
  82
  83         ListConstIterator<ShellingOrderSet> it;
  84         for(it = partition.begin(); it.valid(); ++it) {
  85                 node cr = (*it).right();
  86                 if (cr != 0)
  87                         crSets[cr].pushBack(&(*it));
  88         }
  89
  90         const ShellingOrderSet &V1 = partition.front();
  91         for (j = V1.len(); j >= 2; j--)
  92                 outerfaceStack.push(V1[j]);
  93
  94         m_V[1] = V1;
  95
  96         i = 2;
  97         while (!outerfaceStack.empty()) {
  98                 node cr = outerfaceStack.top();
  99                 if (crSets[cr].empty())
 100                         outerfaceStack.pop();
 101                 else {
 102                         m_V[i] = *(crSets[cr].popFrontRet());
 103                         for (j = len(i); j >= 1; j--)
 104                                 outerfaceStack.push ( (m_V[i])[j] );
 105                         i++;
 106                 }
 107         }
 108
 109
 110         for (i = 1; i <= length(); i++) {
 111                 for (j = 1; j <= m_V[i].len(); ++j) {
 112                         m_rank [(m_V[i])[j]] = i;
 113                 }
 114         }
 115 }
 116
 117
 118 } // end namespace ogdf
 119