X-Git-Url: https://ruin.nu/git/?p=germs.git;a=blobdiff_plain;f=src%2Fgenealgorithms.h;h=a91f67ddcae2345497c24841ff93dc6d6d5ebf82;hp=1d74e7130862188d4ff8e0ad57bf8a656e7d6023;hb=4462cded18dd80075c3622e5a87ca6f5f3c84f62;hpb=43b1052d74a207fe667b75e41d0c70c1189c2cc8

diff --git a/src/genealgorithms.h b/src/genealgorithms.h
index 1d74e71..a91f67d 100644
--- a/src/genealgorithms.h
+++ b/src/genealgorithms.h
@@ -26,7 +26,10 @@
 class GeneOrder;
 struct Component;
 
-
+/**
+ * Simple interval struct, holds the indexes + information if the interval is
+ * oriented or not.
+ */
 struct Interval{
 	Interval(size_t f,size_t s,bool o = false):first(f),second(s),oriented(o){}
 	bool operator==(const Interval& i){
@@ -44,6 +47,8 @@ struct Interval{
 std::pair<int,int> longestSequences(const GeneOrder& go);
 
 /**
+ * Uses the Robinson-Schensted algorithm on the gene order. Gives the longest
+ * increasing and decreasing subsequences.
  */
 std::vector<std::vector<int> > robinsonSchensted(const GeneOrder& go);