X-Git-Url: https://ruin.nu/git/?a=blobdiff_plain;ds=sidebyside;f=src%2Fgenealgorithms.cpp;h=ec3a92ea1890f1d9e36554e10086ef4e695c06f3;hb=65f449adad91a229757c0317c27ad9fb87a4d222;hp=7dc832f252c208900b92c234879c8f09b5a93c24;hpb=e7953f0050007cd1999d64d985d0a063b9ddc99b;p=germs.git

diff --git a/src/genealgorithms.cpp b/src/genealgorithms.cpp
index 7dc832f..ec3a92e 100644
--- a/src/genealgorithms.cpp
+++ b/src/genealgorithms.cpp
@@ -24,6 +24,7 @@
 #include <algorithm>
 #include <set>
 #include <cstdlib>
+#include <iostream>
 using namespace std;
 
 std::pair<int,int> longestSequences(const GeneOrder& go){
@@ -55,12 +56,72 @@ std::vector<std::vector<int> > robinsonSchensted(const GeneOrder& go){
 	return v;
 }
 
+struct FindP{
+	size_t p;
+	FindP(size_t p) : p(p) {}
+	bool operator()(Interval i){
+		return (i.first == p || i.second == p);
+	}
+};
+
+
+std::vector<Interval> findIntervalsAtPoints(const vector<Interval>& intervals){
+	vector<Interval> points;
+	for (size_t p = 1; p <= intervals.size(); ++p){
+		cout << endl << "Point " << p << " : ";
+		size_t f = 0;
+		size_t s = 0;
+		bool found = false;
+		size_t n = 0;
+		for (vector<Interval>::const_iterator i = intervals.begin(); i != intervals.end(); ++i, ++n){
+			if (i->first == p){
+				if (!found){
+					f = n;
+					found = true;
+				}else{
+					s = n;
+					break;
+				}
+			}
+			if (i->second == p){
+				if (!found){
+					f = n;
+					found = true;
+				}else{
+					s = n;
+					break;
+				}
+			}
+		}
+		cout << f << ":" << s << endl;
+		points.push_back(Interval(f,s));
+	}
+	return points;
+
+}
+
 int countCycles(const GeneOrder& go){
 	int cycles = 0;
 	set<size_t> marked;
-	for (size_t p = 1; p < go.size() - 1; ++p){
+	vector<Interval> intervals = findIntervals(go);
+	vector<Interval> points;
+	for (size_t p = 1; p < go.size(); ++p){
 		if (marked.find(p) != marked.end())
 			continue;
+		Interval i = intervals[points[p-1].first];
+		while (marked.find(p) != marked.end()){
+			marked.insert(p);
+			if (i == intervals[points[p-1].first])
+				i = intervals[points[p-1].second];
+			else
+				i = intervals[points[p-1].first];
+
+			if (p == i.first)
+				p = i.second;
+			else
+				p = i.first;
+		}
+		++cycles;
 	}
 	return cycles;
 }
@@ -69,6 +130,37 @@ std::vector<Component> findComponents(const GeneOrder& go){
 	return vector<Component>();
 }
 
+/**
+ * TODO: Think of a better than O(n^2) implementation
+ * Possibly move it to GeneOrder too
+ */
 std::vector<Interval> findIntervals(const GeneOrder& go){
-	return vector<Interval>();
+	vector<Interval> intervals;
+	for (size_t i = 0; i < go.size() - 1; ++i){
+		size_t f = 0;
+		size_t s = 0;
+		bool found = false;
+		size_t n = 0;
+		for (GeneOrder::iterator g = go.begin(); g != go.end(); ++g, ++n){
+			if (static_cast<size_t>(abs(*g)) == i){
+				f = n;
+				if (*g >= 0)
+					++f;
+				if (found)
+					break;
+				found = true;
+			}
+			if(static_cast<size_t>(abs(*g)) == i+1){
+				s = n;
+				if (*g < 0)
+					++s;
+				if (found)
+					break;
+				found = true;
+			}
+		}
+		intervals.push_back(Interval(f,s));
+	}
+	return intervals;
 }
+