src/genesorter.cpp

   1 /***************************************************************************
   2  *   Copyright (C) 2006 by Michael Andreen                                 *
   3  *   andreen@student.chalmers.se                                           *
   4  *                                                                         *
   5  *   This program is free software; you can redistribute it and/or modify  *
   6  *   it under the terms of the GNU General Public License as published by  *
   7  *   the Free Software Foundation; either version 2 of the License, or     *
   8  *   (at your option) any later version.                                   *
   9  *                                                                         *
  10  *   This program is distributed in the hope that it will be useful,       *
  11  *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
  12  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
  13  *   GNU General Public License for more details.                          *
  14  *                                                                         *
  15  *   You should have received a copy of the GNU General Public License     *
  16  *   along with this program; if not, write to the                         *
  17  *   Free Software Foundation, Inc.,                                       *
  18  *   51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA          *
  19  ***************************************************************************/
  20
  21 #include "genesorter.h"
  22
  23 #include "geneorder.h"
  24 #include "sortaction.h"
  25 #include "reverseaction.h"
  26
  27 #include "genealgorithms.h"
  28
  29 #include <queue>
  30 using namespace std;
  31
  32 GeneSorter::ActionList GeneSorter::sort(const GeneOrder& go){
  33         ActionList al;
  34         GeneOrder temp(go);
  35         while(inversionDistance(go) > 0){
  36                 ActionList safe = safeActions(go);
  37                 if (safe.size() > 0){
  38                         safe[0](temp);
  39                         al.push_back(safe[0]);
  40                 }else
  41                         return ActionList(); //TODO: Need to handle hurdles.
  42         }
  43         return al;
  44 }
  45
  46 GeneSorter::ActionList GeneSorter::safeActions(const GeneOrder& go){
  47         if (countCycles(go) == go.size() - 1)
  48                 return ActionList();
  49         ActionList al;
  50         //al.push_back(SortAction(new ReverseAction(2,3)));
  51         return al;
  52 }