@@ -21,7 +21,7 @@
       }
     }
 
-   /**
+    /**
     * Finds all the permutations of given array.<br><br>
     * Permutation relates to the act of rearranging, or permuting,
     * all the members of a set into some sequence or order.
 
@@ -66,31 +66,6 @@
     }
   };
 
-//  function isSubstr(tree, str) {
-//    if (!tree) {
-//      return false;
-//    }
-//    if (tree.nodes[str[0]]) {
-//      return isSubstr(tree, str.substr(1, str.length));
-//    }
-//    var match = '';
-//    for (var i = 0; i < Math.min(tree.value.length, str.length); i += 1) {
-//      if (tree.value[i] === str[i]) {
-//        match += str[i];
-//      } else {
-//        break;
-//      }
-//    }
-//    if (match.length === str.length) {
-//      return true;
-//    }
-//    return false;
-//  }
-
-  // var suffix = new SuffixTree();
-  // suffix.build('banana');
-  // console.log(suffix);
-
   exports.Node = Node;
   exports.SuffixTree = SuffixTree;
 
 
@@ -3,7 +3,7 @@
 
   exports.longestSubsequence = (function () {
 
-   /**
+    /**
     * Find the index of the first largest element in array.
     * Complexity: O(N).
     *
@@ -29,15 +29,15 @@
       return maxIdx;
     }
 
-   /**
+    /**
     * Default comparison method.
     * @private
     */
     function cmp(a, b) {
       return a.distance - b.distance;
     }
 
-   /**
+    /**
     * Creates directed graph from given array.
     * Each element's neighbours are the elements which can be
     * after the element in the resulting sequence.<br><br>
@@ -59,7 +59,7 @@
       return result;
     }
 
-   /**
+    /**
     * Finds the longest sub-sequence for given node.<br><br>
     * Complexity: O(N^N).
     * @private
@@ -98,7 +98,7 @@
       return result;
     }
 
-    /**
+     /**
      * Algorithm from dynamic programming. It finds the longest
      * sub-sequence of increasing numbers. It is not required
      * the numbers to be neighboring. For example for 1, 5, 2
 
@@ -28,7 +28,7 @@
 (function (exports) {
   'use strict';
 
-  /**
+   /**
    * Initialization.<br><br>
    * Time complexity: O(N).
    *
@@ -45,7 +45,7 @@
     }
   };
 
-  /**
+   /**
    * Finds the root of given node.<br><br>
    * Time complexity: O(log N).
    * @private
@@ -60,7 +60,7 @@
     return i;
   };
 
-  /**
+   /**
    * Checks whether two nodes are connected.<br><br>
    * Time complexity: O(log N).
    *
@@ -72,7 +72,7 @@
     return this._root(p) === this._root(q);
   };
 
-  /**
+   /**
    * Connects two nodes - p and q.<br><br>
    * Time complexity: O(log N).
    *
Original file line number	Diff line number	Diff line change
`@@ -21,7 +21,7 @@`
`21`	`21`	`}`
`22`	`22`	`}`
`23`	`23`
`24`		`- /**`
	`24`	`+ /**`
`25`	`25`	`* Finds all the permutations of given array.<br><br>`
`26`	`26`	`* Permutation relates to the act of rearranging, or permuting,`
`27`	`27`	`* all the members of a set into some sequence or order.`