algorithm-visualizer · TornjV · Aug 23, 2016 · Aug 23, 2016 · Aug 23, 2016
diff --git a/algorithm/category.json b/algorithm/category.json
@@ -37,6 +37,7 @@
          "bfs": "BFS",
          "bridges": "Find-Bridges",
          "dfs": "DFS",
+         "dls": "Depth-Limited Search",
          "dijkstra": "Dijkstra",
          "floyd_warshall": "Floyd-Warshall",
          "page_rank": "PageRank Algorithm",

diff --git a/algorithm/graph_search/dls/count_descendant/code.js b/algorithm/graph_search/dls/count_descendant/code.js
@@ -0,0 +1,17 @@
+// This is a sample DLS applications where
+// we try to find number of descendant of root within some depth
+function DLSCount (limit, node, parent) { // node = current node, parent = previous node
+    tracer._visit(node, parent)._wait();
+    var child = 0;
+    if (limit>0) { // cut off the search
+        for (var i = 0; i < G[node].length; i++) {
+            if (G[node][i]) { // if current node has the i-th node as a child
+                child += 1 + DLSCount(limit-1, i, node); // recursively call DLS
+            }
+        }
+        return child;
+    }else{
+      return child;
+    }
+}
+logger._print('Number of descendant is ' + DLSCount(2,0));
diff --git a/algorithm/graph_search/dls/count_descendant/data.js b/algorithm/graph_search/dls/count_descendant/data.js
@@ -0,0 +1,17 @@
+var tracer = new DirectedGraphTracer();
+var logger = new LogTracer();
+tracer.attach(logger);
+var G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
+    [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
+];
+tracer._setTreeData(G, 0);
diff --git a/algorithm/graph_search/dls/desc.json b/algorithm/graph_search/dls/desc.json
@@ -0,0 +1,15 @@
+{
+  "DLS": "Depth-Limited search (DLS) is an algorithm for traversing or searching tree or graph data structures. It's actually specific type of DFS where the search is limited to some depth from start node (root). One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible (within some limit) along each branch before backtracking.",
+  "Complexity": {
+    "time": "worst $O(b^l)$",
+    "space": "worst $O(bl)$",
+    "notes" : "</br>b is branching factor, for example binary tree has branching factor 2 </br> l is limit that we define"
+  },
+  "References": [
+    "<a href='http://www.cs.colostate.edu/~anderson/cs440/index.html/doku.php?id=notes:week2b'>Colorado State University Lecture Notes</a>"
+  ],
+  "files": {
+    "tree": "Searching a tree (limited depth)",
+    "count_descendant": "Count all descendant of root within some depth"
+  }
+}
diff --git a/algorithm/graph_search/dls/tree/code.js b/algorithm/graph_search/dls/tree/code.js
@@ -0,0 +1,13 @@
+// This is a sample DLS where
+// we try to find number of descendant of root within some depth
+function DLS (limit, node, parent) { // node = current node, parent = previous node
+    tracer._visit(node, parent)._wait();
+    if (limit>0) { // cut off the search
+        for (var i = 0; i < G[node].length; i++) {
+            if (G[node][i]) { // if current node has the i-th node as a child
+                DLS(limit-1, i, node); // recursively call DLS
+            }
+        }
+    }
+}
+DLS(2,0);
diff --git a/algorithm/graph_search/dls/tree/data.js b/algorithm/graph_search/dls/tree/data.js
@@ -0,0 +1,17 @@
+var tracer = new DirectedGraphTracer();
+var logger = new LogTracer();
+tracer.attach(logger);
+var G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
+    [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
+];
+tracer._setTreeData(G, 0);