X-Git-Url: https://ruin.nu/git/?p=germs.git;a=blobdiff_plain;f=src%2Fgenesorter.cpp;h=3198543fae391f4805211406a5f8f76ccf28c889;hp=3ce89ad493d6163ee568a0f4e3697a1face13946;hb=34293060b5be57f6e2ea620ad4c3ff0f94e1d305;hpb=cc3e3bd109d72d82826629b96f8e6721d5243cf7 diff --git a/src/genesorter.cpp b/src/genesorter.cpp index 3ce89ad..3198543 100644 --- a/src/genesorter.cpp +++ b/src/genesorter.cpp @@ -26,38 +26,42 @@ #include "genealgorithms.h" +#include "model.h" + #include -#include -#include using namespace std; -GeneSorter::ActionList GeneSorter::sort(const GeneOrder& go){ +struct ScoreCmp { + template + bool operator()(T s1, T s2){ + return s1.first < s2.first; + } +}; + +GeneSorter::ActionList GeneSorter::sort(const GeneOrder& go, const Model& m){ ActionList al; GeneOrder temp(go); - while(inversionDistance(temp) > 0){ + size_t dist = inversionDistance(temp); + while(dist > 0){ //cout << "Distance: " << inversionDistance(temp) << " : "; //copy(temp.begin(), temp.end(), ostream_iterator(cout, " ")); //cout << endl; ActionList safe = safeActions(temp); if (safe.size() > 0){ - safe[0](temp); - cout << "Action: " << safe[0].toString() << endl; - al.push_back(safe[0]); + priority_queue,vector >, ScoreCmp > pq; + for (ActionList::iterator sa = safe.begin(); sa != safe.end(); ++sa){ + pq.push(pair(m.score(*sa,temp),*sa)); + } + SortAction sa = pq.top().second; + sa(temp); + al.push_back(sa); + --dist; }else return ActionList(); //TODO: Need to handle hurdles. } - cout << "Distance: " << inversionDistance(temp) << " : "; - copy(temp.begin(), temp.end(), ostream_iterator(cout, " ")); - cout << endl; return al; } -struct ScoreCmp { - template - bool operator()(T s1, T s2){ - return s1.first < s2.first; - } -}; GeneSorter::ActionList GeneSorter::safeActions(const GeneOrder& go){ if (countCycles(go) == go.size() - 1) @@ -73,7 +77,8 @@ GeneSorter::ActionList GeneSorter::safeActions(const GeneOrder& go){ pq.push(pair(score,sa)); } } - while (pq.size() > 0){ + size_t max = pq.top().first; + while (pq.size() > 0 && pq.top().first >= max){ al.push_back(pq.top().second); pq.pop(); }