ext/OGDF/src/planarity/MMSubgraphPlanarizer.cpp

   1 /*
   2  * $Revision: 2559 $
   3  *
   4  * last checkin:
   5  *   $Author: gutwenger $
   6  *   $Date: 2012-07-06 15:04:28 +0200 (Fr, 06. Jul 2012) $
   7  ***************************************************************/
   8
   9 /** \file
  10  * \brief Implements class MMSubgraphPlanarizer.
  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/planarity/MMSubgraphPlanarizer.h>
  44 #include <ogdf/planarity/FastPlanarSubgraph.h>
  45 #include <ogdf/planarity/MMFixedEmbeddingInserter.h>
  46
  47
  48 namespace ogdf {
  49
  50
  51 MMSubgraphPlanarizer::MMSubgraphPlanarizer()
  52 {
  53         FastPlanarSubgraph *s = new FastPlanarSubgraph();
  54         s->runs(100);
  55         m_subgraph.set(s);
  56
  57         MMFixedEmbeddingInserter *pInserter = new MMFixedEmbeddingInserter();
  58         pInserter->removeReinsert(MMEdgeInsertionModule::rrAll);
  59         m_inserter.set(pInserter);
  60
  61         m_permutations = 1;
  62 }
  63
  64
  65 Module::ReturnType MMSubgraphPlanarizer::doCall(PlanRepExpansion &PG,
  66         int cc,
  67         const EdgeArray<bool> *forbid,
  68         int& crossingNumber,
  69         int& numNS,
  70         int& numSN)
  71 {
  72         OGDF_ASSERT(m_permutations >= 1);
  73
  74         List<edge> deletedEdges;
  75         PG.initCC(cc);
  76
  77         ReturnType retValue ;
  78
  79         if(forbid != 0) {
  80                 List<edge> preferedEdges;
  81                 edge e;
  82                 forall_edges(e, PG) {
  83                         edge eOrig = PG.originalEdge(e);
  84                         if(eOrig && (*forbid)[eOrig])
  85                                 preferedEdges.pushBack(e);
  86                 }
  87
  88                 retValue = m_subgraph.get().call(PG, preferedEdges, deletedEdges, true);
  89
  90         } else {
  91                 retValue = m_subgraph.get().call(PG, deletedEdges);
  92         }
  93
  94         if(isSolution(retValue) == false)
  95                 return retValue;
  96
  97         for(ListIterator<edge> it = deletedEdges.begin(); it.valid(); ++it)
  98                 *it = PG.originalEdge(*it);
  99
 100         int bestcr = -1;
 101
 102         for(int i = 1; i <= m_permutations; ++i)
 103         {
 104                 for(ListConstIterator<edge> it = deletedEdges.begin(); it.valid(); ++it)
 105                         PG.delCopy(PG.copy(*it));
 106
 107                 deletedEdges.permute();
 108
 109                 if(forbid != 0)
 110                         m_inserter.get().call(PG, deletedEdges, *forbid);
 111                 else
 112                         m_inserter.get().call(PG, deletedEdges);
 113
 114                 crossingNumber = PG.computeNumberOfCrossings();
 115
 116                 if(i == 1 || crossingNumber < bestcr) {
 117                         bestcr = crossingNumber;
 118                         numNS = PG.numberOfNodeSplits();
 119                         numSN = PG.numberOfSplittedNodes();
 120                 }
 121
 122                 PG.initCC(cc);
 123         }
 124
 125         crossingNumber = bestcr;
 126
 127         return retFeasible;
 128 }
 129
 130
 131 } // namspace ogdf